224322026-01-15 08:08:05sandormeszicsFasor (40)cpp17Wrong answer 34/4075ms1320 KiB
#include <iostream>

using namespace std;

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

    return -1;
}

int main()
{
    int a[200000] = {0}, n, k;
    cin >> n >> k;

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

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


    return 0;
}
SubtaskSumTestVerdictTimeMemory
base34/40
1Accepted0/01ms1260 KiB
2Accepted0/04ms1076 KiB
3Accepted2/22ms1076 KiB
4Wrong answer0/22ms1080 KiB
5Accepted2/22ms1076 KiB
6Accepted2/22ms1264 KiB
7Accepted2/22ms1076 KiB
8Accepted2/22ms1076 KiB
9Accepted2/24ms1004 KiB
10Accepted2/24ms1320 KiB
11Accepted2/24ms1184 KiB
12Accepted2/23ms1076 KiB
13Accepted2/237ms1176 KiB
14Wrong answer0/235ms1188 KiB
15Accepted2/259ms1176 KiB
16Accepted2/267ms1172 KiB
17Accepted2/275ms1184 KiB
18Accepted2/275ms1076 KiB
19Accepted2/272ms1176 KiB
20Wrong answer0/221ms1172 KiB
21Accepted2/259ms1176 KiB
22Accepted2/272ms1268 KiB