177012025-09-15 14:00:54algoproFasor (40)cpp17Wrong answer 34/4071ms1200 KiB
// UUID: 1ab50bcb-ebba-40ca-8478-231c41890f8b
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k; cin >> n >> k;

	vector<int> fak(n);
	for (int i=0; i<n; i++) cin >> fak[i];

	int vok=0;

	bool van=false;

	for (int i=0; i<n && !van; i++){
		if (fak[i] > fak[vok]){
			vok = i;
		}

		if (i-vok == k){
			van = true;
		}
	}

	if (van) cout << vok+1;
	else cout << -1;


}
SubtaskSumTestVerdictTimeMemory
base34/40
1Accepted0/01ms316 KiB
2Accepted0/04ms500 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/24ms436 KiB
10Accepted2/24ms424 KiB
11Accepted2/24ms436 KiB
12Accepted2/23ms316 KiB
13Accepted2/235ms564 KiB
14Wrong answer0/232ms804 KiB
15Accepted2/256ms1080 KiB
16Accepted2/264ms1192 KiB
17Accepted2/271ms1076 KiB
18Accepted2/271ms1076 KiB
19Accepted2/271ms1200 KiB
20Wrong answer0/220ms800 KiB
21Accepted2/256ms1076 KiB
22Accepted2/270ms1076 KiB