Submission #18,208

2025-10-14 07:37:17

cpp17

Wrong answer 34/40

41ms

528 KiB

#include <iostream>

using namespace std;

int main()
{
    int n,k,x,bestp=1,bestm;
    //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){
            cout<<bestp;
            break;
        }
    }
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	34/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Wrong answer	0/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	528 KiB
		7	Accepted	2/2	1ms	508 KiB
		8	Accepted	2/2	1ms	316 KiB
		9	Accepted	2/2	1ms	316 KiB
		10	Accepted	2/2	2ms	508 KiB
		11	Accepted	2/2	1ms	316 KiB
		12	Accepted	2/2	1ms	508 KiB
		13	Accepted	2/2	34ms	400 KiB
		14	Wrong answer	0/2	32ms	316 KiB
		15	Accepted	2/2	35ms	400 KiB
		16	Accepted	2/2	32ms	392 KiB
		17	Accepted	2/2	41ms	508 KiB
		18	Accepted	2/2	34ms	316 KiB
		19	Accepted	2/2	32ms	508 KiB
		20	Wrong answer	0/2	19ms	508 KiB
		21	Accepted	2/2	41ms	508 KiB
		22	Accepted	2/2	30ms	316 KiB