223542026-01-14 21:55:40FintaTihamerFasor (40)cpp17Wrong answer 36/4074ms1152 KiB
#include <iostream>
#include <fstream>
using namespace std;
void ki(int y){
    if(y!=0) cout<<y+1;
    else cout<<-1;
}
int moz(){
    int n;
    int k;
    int a[200000];
    int j=0;
    int i=1;
    cin>>n>>k;
    int k1=k;
    for(int x=0; x<n; x++) cin>>a[x];
    while(i<n && k1>=0){
        if(a[i]>a[j] && k1>=0 && i>j) {j=i; k1=k;}
        k1--;
        i++;
    }
    return j;
}
void moz2(){

}
int main()
{   ki(moz());
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base36/40
1Accepted0/01ms500 KiB
2Accepted0/04ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms500 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms316 KiB
9Wrong answer0/24ms360 KiB
10Accepted2/24ms316 KiB
11Accepted2/24ms320 KiB
12Accepted2/23ms536 KiB
13Accepted2/237ms564 KiB
14Accepted2/235ms612 KiB
15Accepted2/259ms1020 KiB
16Accepted2/268ms1152 KiB
17Accepted2/274ms1024 KiB
18Accepted2/274ms1052 KiB
19Accepted2/272ms1096 KiB
20Accepted2/221ms552 KiB
21Accepted2/261ms1080 KiB
22Accepted2/274ms1076 KiB