134512025-01-08 07:42:29GundischBalazsFasor (40)cpp17Wrong answer 36/4045ms552 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, k,maxi,db=0,x,i=1,mi=0;
    cin >> n >> k;
    cin >> x;
    maxi = x;
   while(i <= n){
        cin >> x;
        if(x > maxi){
            maxi = x;
            mi = i;
            db=0;
        }
        else{
            db++;
        }
        if(db==k){
            cout << mi+1;
            return 0;
        }
        i++;
    }
    cout << -1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base36/40
1Accepted0/01ms316 KiB
2Accepted0/01ms500 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms552 KiB
10Accepted2/21ms328 KiB
11Accepted2/21ms316 KiB
12Accepted2/21ms316 KiB
13Accepted2/235ms396 KiB
14Wrong answer0/234ms396 KiB
15Accepted2/239ms508 KiB
16Accepted2/234ms396 KiB
17Accepted2/243ms552 KiB
18Accepted2/234ms500 KiB
19Accepted2/234ms508 KiB
20Wrong answer0/220ms316 KiB
21Accepted2/245ms392 KiB
22Accepted2/232ms392 KiB