224282026-01-15 08:01:55sandormeszicsFasor (40)cpp17Wrong answer 4/4070ms1136 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;
        for(int j = 0; j < k+1; j++){
            if(a[i] < a[i+j]){
                b = false;
            }
        }
        if(b){
            return i+1;
        }
        i +=k;
    }

    return -1;
}

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

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

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


    return 0;
}
SubtaskSumTestVerdictTimeMemory
base4/40
1Wrong answer0/01ms332 KiB
2Wrong answer0/04ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms500 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/24ms404 KiB
10Wrong answer0/24ms428 KiB
11Wrong answer0/24ms508 KiB
12Wrong answer0/23ms316 KiB
13Wrong answer0/235ms564 KiB
14Wrong answer0/232ms564 KiB
15Wrong answer0/256ms960 KiB
16Wrong answer0/264ms956 KiB
17Wrong answer0/270ms1076 KiB
18Wrong answer0/270ms1076 KiB
19Wrong answer0/270ms1136 KiB
20Wrong answer0/220ms564 KiB
21Wrong answer0/256ms1076 KiB
22Wrong answer0/270ms1020 KiB