Submission #9,096

2024-02-13 21:32:20

cpp17

Accepted 40/40

45ms

4100 KiB

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

int n, k, most;

int main() {
	cin >> n >> k >> most;
	int max_i = 1, max_sz = most;
	for(int i = 2; i <= n; i++) {
		cin >> most;
		if(i - max_i > k) break;
		if(most > max_sz) {
			max_sz = most;
			max_i = i;
 		}
	}
	cout << max_i;
 
	return 0;
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	3ms	1872 KiB
		2	Accepted	0/0	3ms	2120 KiB
		3	Accepted	2/2	2ms	2204 KiB
		4	Accepted	2/2	3ms	2336 KiB
		5	Accepted	2/2	3ms	2552 KiB
		6	Accepted	2/2	3ms	2640 KiB
		7	Accepted	2/2	3ms	2828 KiB
		8	Accepted	2/2	3ms	2988 KiB
		9	Accepted	2/2	3ms	3068 KiB
		10	Accepted	2/2	3ms	3192 KiB
		11	Accepted	2/2	3ms	3416 KiB
		12	Accepted	2/2	3ms	3388 KiB
		13	Accepted	2/2	37ms	3516 KiB
		14	Accepted	2/2	34ms	3632 KiB
		15	Accepted	2/2	39ms	3756 KiB
		16	Accepted	2/2	34ms	3724 KiB
		17	Accepted	2/2	43ms	3868 KiB
		18	Accepted	2/2	34ms	3800 KiB
		19	Accepted	2/2	35ms	4044 KiB
		20	Accepted	2/2	23ms	4092 KiB
		21	Accepted	2/2	45ms	4092 KiB
		22	Accepted	2/2	32ms	4100 KiB