224272026-01-15 08:00:46sandormeszicsFasor (40)cpp17Wrong answer 18/40300ms1160 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;
        }
    }

    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
base18/40
1Accepted0/01ms316 KiB
2Accepted0/04ms316 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms408 KiB
11Accepted2/24ms408 KiB
12Accepted2/23ms376 KiB
13Time limit exceeded0/2300ms744 KiB
14Wrong answer0/232ms712 KiB
15Time limit exceeded0/2300ms1160 KiB
16Time limit exceeded0/2298ms968 KiB
17Time limit exceeded0/2284ms1076 KiB
18Time limit exceeded0/2282ms956 KiB
19Time limit exceeded0/2284ms992 KiB
20Time limit exceeded0/2284ms756 KiB
21Time limit exceeded0/2284ms1004 KiB
22Time limit exceeded0/2284ms1076 KiB