Submission #1679815

---

Source Code Expand

#include<iostream>
#include<string.h>
#include<ctype.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#define pi 3.141592653589
#define rep(i,a,n) for(int i=a;i<n;i++)
#define INF 1e9
#define LINF 1e17
#define ll long long
#define MOD (int)(1e9+7)
using namespace std;

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };



int main() {

	int n, k, a, b;
	int ans = 0, len = 1;

	cin >> n >> k;
	rep(i, 0, n) {
		if (i == 0)cin >> a;
		else {
			b = a;
			cin >> a;
			if (a > b) {
				len++;
			}
			else {
				ans += max(0, len - k + 1);
				len = 1;
			}
		}
	}
	ans += max(0, len - k + 1);
	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result