178952025-09-22 17:55:04algoproFasor (40)cpp17Accepted 40/4071ms2036 KiB
// UUID: 5704215f-a894-4480-8412-04dc0484e000
#include <bits/stdc++.h>
using namespace std;

int main() {
	long long n;
	long long k;
	cin>>n>>k;
	vector<long long>v(n);
	for(int i=0;i<n;i++){
		cin>>v[i];
	
	}

	long long chosen=0;
	bool x=true;
	while(x){
		x=false;
		for (int j=1; j<=k; j++){
			
			if (chosen+j<n && v[chosen]<v[chosen+j]){
				chosen=chosen+j;
				x=true;
				
				break;
			}
		}

		}
		
	cout << chosen+1;}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms504 KiB
2Accepted0/04ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms532 KiB
9Accepted2/24ms480 KiB
10Accepted2/24ms480 KiB
11Accepted2/24ms316 KiB
12Accepted2/23ms316 KiB
13Accepted2/235ms1076 KiB
14Accepted2/234ms1272 KiB
15Accepted2/257ms1972 KiB
16Accepted2/265ms2036 KiB
17Accepted2/271ms1844 KiB
18Accepted2/271ms1976 KiB
19Accepted2/271ms1844 KiB
20Accepted2/221ms1048 KiB
21Accepted2/259ms1844 KiB
22Accepted2/271ms1844 KiB