223802026-01-14 22:46:49FintaTihamerFasor (40)cpp17Time limit exceeded 22/40300ms1180 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;
}
int main()
{   //ki(moz());
    cout<<1;
    return 0;
}*/
#include <iostream>
using namespace std;
int main()
{int i,s,t,b,a[200000],n,k;
    cin>>n>>k;
    for(i=0;i<n;i++){
        cin>>a[i];
    }
    b=-1;i=0;
    while(i<n && b==-1){t=1;s=1;
        if(i+k<n && i-k<=0){while(s<=k && t==1){
            if(a[i]<a[i+s])t=0;
            s++;
        }
        }
        else {s=1;
            while(s<=k && t==1){
                if(a[i]<a[i+s])t=0;
                s++;
            }
        }
        if(t==1)b=i+1;
        i++;
    }cout<<b;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base22/40
1Accepted0/01ms316 KiB
2Accepted0/04ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms500 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms412 KiB
11Accepted2/24ms436 KiB
12Accepted2/24ms316 KiB
13Time limit exceeded0/2298ms752 KiB
14Time limit exceeded0/2300ms716 KiB
15Time limit exceeded0/2300ms1032 KiB
16Time limit exceeded0/2300ms976 KiB
17Time limit exceeded0/2284ms1040 KiB
18Time limit exceeded0/2270ms1052 KiB
19Time limit exceeded0/2216ms1076 KiB
20Time limit exceeded0/2287ms612 KiB
21Time limit exceeded0/2284ms1076 KiB
22Accepted2/272ms1180 KiB