224672026-01-15 09:01:14sandormeszicsFasor (40)cpp17Accepted 40/4023ms1268 KiB
#include <iostream>

using namespace std;

int boldog(int a[200001], int n, int k){
    for(int i = 0; i < n; i++){
        int j = 0;
        while(j < k+1 && i+j < n && a[i] >= a[i+j]){
            j++;
        }
        if(j == k+1 || i+j >= n){
            return i+1;
        }
        else{
            i += j-1;
        }
    }

    return -1;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int a[200001] = {0}, n, k;
    cin >> n >> k;

    for(int i = 0; i < n; i++){
        cin >> a[i];
    }

    cout << boldog(a, n, k);


    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/02ms1260 KiB
2Accepted0/03ms1076 KiB
3Accepted2/22ms1268 KiB
4Accepted2/22ms1076 KiB
5Accepted2/22ms1216 KiB
6Accepted2/22ms1076 KiB
7Accepted2/22ms1076 KiB
8Accepted2/22ms1220 KiB
9Accepted2/22ms1076 KiB
10Accepted2/22ms1080 KiB
11Accepted2/23ms1104 KiB
12Accepted2/22ms1076 KiB
13Accepted2/213ms1076 KiB
14Accepted2/212ms1076 KiB
15Accepted2/219ms1268 KiB
16Accepted2/220ms1076 KiB
17Accepted2/223ms1076 KiB
18Accepted2/223ms1200 KiB
19Accepted2/223ms1200 KiB
20Accepted2/28ms1076 KiB
21Accepted2/218ms1268 KiB
22Accepted2/223ms1076 KiB