Submission #1381861

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
//#define int long long
using namespace std;
typedef long long ll;
const int INF = 1e9;

int N, K;
int A[300010];
int cnt[300010];

signed main()
{
    cin >> N >> K;

    int ans = 0;
    REP(i,N) {
        cin >> A[i];
        if (i == 0) {
            cnt[i] = 1;
            if (cnt[i] >= K) ans++;
            continue;
        }
        if (A[i-1] < A[i]) {
            cnt[i] = cnt[i-1] + 1;
        } else {
            cnt[i] = 1;
        }
        if (cnt[i] >= K) ans++;
    }

    cout << ans << endl;
}

Submission Info

Judge Result