Submission #3,798

2023-03-02 22:38:54

cpp17

Accepted 40/40

24ms

5276 KiB

#include<bits/stdc++.h>
using namespace std;

void solve(){
    int n, k;
    cin>>n>>k;
    vector<int> a(n);
    for(int &x : a) cin>>x;
    int maxi=a[0], maxih=0;
    for(int i=1; i<n; i++){
        if(i-maxih>k) break;
        if(a[i]>maxi){
            maxih=i;
            maxi=a[i];
        }
    }
    cout<<maxih+1<<"\n";
    return;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    solve();
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	3ms	1828 KiB
		2	Accepted	0/0	3ms	2064 KiB
		3	Accepted	2/2	3ms	2120 KiB
		4	Accepted	2/2	3ms	2332 KiB
		5	Accepted	2/2	2ms	2404 KiB
		6	Accepted	2/2	3ms	2540 KiB
		7	Accepted	2/2	3ms	2768 KiB
		8	Accepted	2/2	3ms	2980 KiB
		9	Accepted	2/2	3ms	3092 KiB
		10	Accepted	2/2	4ms	3408 KiB
		11	Accepted	2/2	4ms	3628 KiB
		12	Accepted	2/2	3ms	3572 KiB
		13	Accepted	2/2	13ms	4416 KiB
		14	Accepted	2/2	12ms	4372 KiB
		15	Accepted	2/2	19ms	5092 KiB
		16	Accepted	2/2	21ms	5084 KiB
		17	Accepted	2/2	23ms	5088 KiB
		18	Accepted	2/2	23ms	5088 KiB
		19	Accepted	2/2	23ms	5016 KiB
		20	Accepted	2/2	9ms	4440 KiB
		21	Accepted	2/2	19ms	5016 KiB
		22	Accepted	2/2	24ms	5276 KiB