223982026-01-14 23:05:21FintaTihamerFasor (40)cpp17Wrong answer 4/4034ms776 KiB
#include <iostream>
#include <fstream>
using namespace std;
void ki(int y){
    //if(y==0) cout<<0;
    //else
    cout<<y+1;
}
int moz(){
    int n;
    int k;
    int a[200000];
    int j=0;
    int i=1;
    cin>>n>>k;
    int k1=k;
    while(i<n && k1>=0){
        cin>>a[i-1];
        if(a[i]>a[j] && k1>=0 && i>j) {j=i; k1=k;}
        k1--;
        i++;
    }
    return j;
}
int main()
{   ki(moz());
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base4/40
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/21ms508 KiB
4Wrong answer0/21ms508 KiB
5Accepted2/21ms316 KiB
6Wrong answer0/21ms388 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/21ms500 KiB
10Wrong answer0/21ms508 KiB
11Wrong answer0/21ms316 KiB
12Wrong answer0/21ms316 KiB
13Wrong answer0/29ms492 KiB
14Wrong answer0/234ms776 KiB
15Wrong answer0/223ms580 KiB
16Wrong answer0/218ms488 KiB
17Wrong answer0/232ms616 KiB
18Wrong answer0/213ms316 KiB
19Wrong answer0/24ms316 KiB
20Wrong answer0/210ms580 KiB
21Wrong answer0/227ms704 KiB
22Wrong answer0/217ms564 KiB