Submission #1677654

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for(int i = 0; i < n; i++)
using namespace std;
ll MOD = 1000000007;

int main() {
    int n, k;
    cin >> n >> k;
    int inc = 1;
    int pre;
    int ans = 0;
    imfor(i, n) {
        int a;
        cin >> a;
        if (i == 0) {
            pre = a;
            continue;
        }
        if (pre < a) {
            inc += 1;
            if (inc == k) {
                ans++;
                inc -= 1;
            }
        }
        else {
            inc = 1;
        }
        pre = a;
    }
    if (k == 1) {
        cout << n << endl;
    }
    else {
        cout << ans << endl;
    }
}

Submission Info

Judge Result