Submission #21,074

2026-01-12 11:02:45

cpp17

Accepted 40/40

71ms

1172 KiB

#include <iostream>

using namespace std;

int main()
{
    int n, k;
    cin>>n>>k;
    int t[n];
    for(int i=0; i<n; i++)cin>>t[i];
    int pos=0, veg=k;
    for(int i=1; i<=veg and i<n; i++)
    {
       if(t[i]>t[pos])
       {
           pos=i;
           veg=i+k;
       }
    }
    cout << veg-k+1;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	4ms	508 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	2/2	1ms	500 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Accepted	2/2	2ms	560 KiB
		9	Accepted	2/2	4ms	508 KiB
		10	Accepted	2/2	4ms	316 KiB
		11	Accepted	2/2	4ms	508 KiB
		12	Accepted	2/2	3ms	316 KiB
		13	Accepted	2/2	35ms	672 KiB
		14	Accepted	2/2	32ms	588 KiB
		15	Accepted	2/2	54ms	1108 KiB
		16	Accepted	2/2	64ms	1172 KiB
		17	Accepted	2/2	71ms	1056 KiB
		18	Accepted	2/2	70ms	1020 KiB
		19	Accepted	2/2	70ms	1088 KiB
		20	Accepted	2/2	20ms	564 KiB
		21	Accepted	2/2	56ms	1076 KiB
		22	Accepted	2/2	70ms	1108 KiB