Submission #1518360

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define all(c) begin(c),end(c)


int main() {
	cin.sync_with_stdio(false);
	int N, K;
	cin >> N >> K;
	int A;
	int pre=0;
	int count = 0;
	vector<int>d;
	rep(i, N) {
		cin >> A;
		if (A > pre) {
			count++;
		}
		else {
			d.push_back(count);
			count = 1;
		}
		pre = A;
	}
	d.push_back(count);
	int ans = 0;
	rep(i, d.size()) {
		if (d[i] >= K)ans += d[i] - K + 1;
	}
	cout << ans << "\n";
	return 0;
}

Submission Info

Judge Result