182102025-10-14 07:44:18szabelrFasor (40)cpp17Wrong answer 34/4046ms552 KiB
#include <iostream>

using namespace std;

int main()
{
    int n,k,x,bestp=1,bestm,volte=0;
    //int fak[200001];
    cin>>n>>k;
    cin>>x;
    bestm=x;
    for(int i=2; i<=n; i++){
        cin>>x;
        if(x>bestm){
            bestm=x;
            bestp=i;
            //cout<<bestp;
        }

        if(i-bestp>=k){
            volte=1;
            cout<<bestp;
            break;
        }
    }
    if(volte==0)
        cout<<-1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base34/40
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms508 KiB
7Accepted2/21ms552 KiB
8Accepted2/21ms532 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms316 KiB
12Accepted2/21ms316 KiB
13Accepted2/239ms404 KiB
14Wrong answer0/234ms404 KiB
15Accepted2/239ms396 KiB
16Accepted2/232ms404 KiB
17Accepted2/245ms508 KiB
18Accepted2/234ms396 KiB
19Accepted2/234ms396 KiB
20Wrong answer0/221ms316 KiB
21Accepted2/246ms316 KiB
22Accepted2/232ms316 KiB