176622025-09-01 22:42:22Erik_GepardFasor (40)cpp17Wrong answer 28/4071ms1268 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k;
    cin>>n>>k;
    vector<int> f(n);
    int jó=-1;
    int max=-1;
    int db=0;
    int ok=0;
    for(int i=0; i<n; i++){
        cin>>f[i];
        if(max<f[i]){
            max=f[i];
            jó=i+1;
            db=0;
        }
        else{
            db++;
        }
        if(db==k){
            cout<<jó;
            ok=1;
        }
    }
    if(ok==0){
        cout<<jó;
    }
}
SubtaskSumTestVerdictTimeMemory
base28/40
1Accepted0/01ms500 KiB
2Wrong answer0/04ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Accepted2/21ms500 KiB
8Wrong answer0/22ms540 KiB
9Accepted2/24ms316 KiB
10Wrong answer0/24ms316 KiB
11Wrong answer0/24ms404 KiB
12Accepted2/23ms316 KiB
13Accepted2/235ms800 KiB
14Accepted2/232ms564 KiB
15Accepted2/256ms1196 KiB
16Accepted2/264ms1196 KiB
17Accepted2/271ms1076 KiB
18Accepted2/271ms1076 KiB
19Wrong answer0/271ms1268 KiB
20Accepted2/220ms568 KiB
21Accepted2/256ms1200 KiB
22Wrong answer0/270ms1208 KiB