177002025-09-15 13:55:36algoproFasor (40)cpp17Wrong answer 26/4071ms1304 KiB
// UUID: ad356db8-8003-477f-887f-c48f3136bd47
#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-k; i++){
		if (fak[i] > fak[vok]){
			vok = i;
		}

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

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


}
SubtaskSumTestVerdictTimeMemory
base26/40
1Accepted0/01ms316 KiB
2Accepted0/04ms316 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms508 KiB
5Accepted2/21ms508 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms500 KiB
8Accepted2/22ms500 KiB
9Accepted2/23ms316 KiB
10Accepted2/24ms316 KiB
11Accepted2/24ms316 KiB
12Accepted2/23ms316 KiB
13Wrong answer0/235ms564 KiB
14Wrong answer0/234ms768 KiB
15Wrong answer0/256ms1192 KiB
16Accepted2/264ms984 KiB
17Wrong answer0/271ms1192 KiB
18Accepted2/271ms1076 KiB
19Accepted2/271ms1076 KiB
20Wrong answer0/220ms564 KiB
21Wrong answer0/257ms1076 KiB
22Accepted2/271ms1304 KiB