200792025-12-31 18:36:27algoproFasor (40)cpp17Time limit exceeded 22/40300ms12096 KiB
// UUID: a08a65d1-64ab-4fe9-aa9a-22322d10bfd3
#include <bits/stdc++.h>
using namespace std;
int teszt(vector<int> magas, int i, int k){
    int n= magas.size();
    for(int l=i; l<n-1; l++){
        for(int j=i+1; (j<=i+k && j<n); j++){
            if (magas[j] > magas[i]){ 
                return teszt(magas, j, k);
            }
        }
    }
        return i;
}
int main() {
	int n, k;
    cin >> n >> k;
    vector<int> magas(n);
    for(int i=0; i<n; i++){
        cin >> magas[i];
    }
    int i=0; 
    cout << teszt(magas, i, k)+1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base22/40
1Accepted0/01ms316 KiB
2Accepted0/06ms564 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms508 KiB
8Accepted2/22ms500 KiB
9Accepted2/24ms464 KiB
10Accepted2/26ms492 KiB
11Accepted2/26ms564 KiB
12Accepted2/24ms568 KiB
13Time limit exceeded0/2300ms3364 KiB
14Accepted2/237ms5668 KiB
15Time limit exceeded0/2300ms4524 KiB
16Time limit exceeded0/2300ms2728 KiB
17Time limit exceeded0/2279ms3240 KiB
18Time limit exceeded0/2284ms6320 KiB
19Time limit exceeded0/2289ms12096 KiB
20Time limit exceeded0/2287ms1588 KiB
21Time limit exceeded0/2282ms2872 KiB
22Time limit exceeded0/2275ms11072 KiB