180692025-09-26 22:31:12algoproFasor (40)cpp17Wrong answer 18/40300ms1312 KiB
// UUID: 144a8cdf-42d5-49b6-b09a-e519cc35ee41
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n; 
    int k; cin >> k;
    vector <int> a(n);
    for(int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    int legbal = 0;
    int legjobb = k + 1;
    int ln = 0;
    int db = 0;
    for(int i = 0; i < n; i++)
    {
        for(int j = legbal; j < legjobb; j++)
        {
            if(a[j] > ln){
                ln = a[j];
            }
        }

        if(ln == a[i]){
            cout << i + 1 << '\n';
            db++;
            break;
        }
        
        if(legjobb - (2*k) - 1 >= 0){
            legbal++;
        }
        if(legjobb < n - 1) legjobb++;
    
        ln = 0;
    }
    if(db <= 0) cout << -1 << '\n';

}
SubtaskSumTestVerdictTimeMemory
base18/40
1Accepted0/01ms316 KiB
2Accepted0/04ms316 KiB
3Accepted2/21ms320 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms408 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms316 KiB
11Accepted2/24ms436 KiB
12Accepted2/23ms316 KiB
13Time limit exceeded0/2300ms592 KiB
14Runtime error0/232ms800 KiB
15Time limit exceeded0/2298ms1076 KiB
16Time limit exceeded0/2300ms1076 KiB
17Time limit exceeded0/2284ms1076 KiB
18Time limit exceeded0/2284ms1076 KiB
19Time limit exceeded0/2286ms1312 KiB
20Time limit exceeded0/2286ms564 KiB
21Time limit exceeded0/2284ms1260 KiB
22Time limit exceeded0/2282ms1260 KiB