176502025-08-26 09:31:20algoproFasor (40)cpp17Time limit exceeded 0/40300ms1260 KiB
// UUID: 3cd752f8-4482-4f68-a4d3-4c60a60e883a
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k;
    cin >> n >> k;
    vector<int> magas(n+1);
    for(int i=1; i<=n; i++){
        cin >> magas[i];
    }
  int i=1;
   int megfelel=0;
    while (i<=n-k){
        for (int j=i+1; j<=i+k; j++){
            if (magas[i] < magas[j]) {i=j; megfelel=0;}
            else megfelel++;
        }
    } 
    if(megfelel == k) cout << i-1;
    if (i == n) cout << i-1;
    else {megfelel=0; 
          for(int j=i+1; j<=n; j++){
        if (magas[i] < magas[j]) {i=j; megfelel=0; if (i == n) cout << i-1;}
        else megfelel++;
    } if (megfelel == n-i) cout << i-1;}
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Time limit exceeded0/0289ms500 KiB
2Time limit exceeded0/0289ms316 KiB
3Time limit exceeded0/2289ms316 KiB
4Wrong answer0/21ms508 KiB
5Time limit exceeded0/2300ms316 KiB
6Time limit exceeded0/2286ms316 KiB
7Time limit exceeded0/2286ms512 KiB
8Time limit exceeded0/2287ms500 KiB
9Time limit exceeded0/2300ms316 KiB
10Time limit exceeded0/2275ms508 KiB
11Time limit exceeded0/2275ms316 KiB
12Time limit exceeded0/2275ms316 KiB
13Time limit exceeded0/2300ms564 KiB
14Wrong answer0/235ms568 KiB
15Time limit exceeded0/2287ms1076 KiB
16Time limit exceeded0/2289ms1260 KiB
17Time limit exceeded0/2300ms1076 KiB
18Time limit exceeded0/2282ms1076 KiB
19Time limit exceeded0/2282ms1076 KiB
20Wrong answer0/223ms564 KiB
21Time limit exceeded0/2300ms1076 KiB
22Time limit exceeded0/2286ms1076 KiB