177452025-09-16 18:50:48algoproFasor (40)cpp17Accepted 40/4074ms2036 KiB
// UUID: 25e7098a-8bd1-407a-baad-cc560f38d8b9
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
	ll n, k;
	cin >> n >> k;
	vector <ll> v(n);
	for (ll i = 0; i < n; i++ ){
		cin >> v[i];
	}
	ll b = 0, j = 0;
	while (j < n){
		if (v[b] >= v[j+1]) j++;
		else b = j+1;
		if ( j-b == k || j == n - 1) {
			cout << b+1 << "\n";
			return 0;
		}
	}
	cout << -1 << "\n";
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/04ms328 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms320 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms512 KiB
9Accepted2/24ms472 KiB
10Accepted2/24ms316 KiB
11Accepted2/24ms352 KiB
12Accepted2/23ms556 KiB
13Accepted2/237ms1076 KiB
14Accepted2/234ms1076 KiB
15Accepted2/259ms1844 KiB
16Accepted2/268ms1844 KiB
17Accepted2/274ms2036 KiB
18Accepted2/272ms1844 KiB
19Accepted2/274ms1844 KiB
20Accepted2/221ms1076 KiB
21Accepted2/261ms1844 KiB
22Accepted2/272ms1844 KiB