177372025-09-16 18:39:33algoproFasor (40)cpp17Wrong answer 34/4075ms2040 KiB
// UUID: ec3172fd-3724-4ce8-997e-2acd9e0bca6a
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
	ll n, k;
	cin >> n >> k;
	vector <ll> v(n);
	for (int 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 ) {
			cout << b+1 << "\n";
			return 0;
		}
	}
	cout << -1 << "\n";
}
SubtaskSumTestVerdictTimeMemory
base34/40
1Accepted0/01ms316 KiB
2Accepted0/04ms508 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms508 KiB
5Accepted2/21ms508 KiB
6Accepted2/21ms500 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms508 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms316 KiB
11Accepted2/24ms500 KiB
12Accepted2/23ms476 KiB
13Accepted2/237ms1076 KiB
14Wrong answer0/234ms1076 KiB
15Accepted2/259ms1976 KiB
16Accepted2/268ms1844 KiB
17Accepted2/274ms2040 KiB
18Accepted2/275ms1844 KiB
19Accepted2/272ms1844 KiB
20Wrong answer0/221ms1080 KiB
21Accepted2/259ms1844 KiB
22Accepted2/271ms1844 KiB