204642026-01-06 19:24:46ProgramozoRokaFasor (40)cpp17Wrong answer 0/40300ms1572 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int N,K;
    cin>>N>>K;
    vector<int> h;
    for(int i=0;i<N;++i)
    {
        int szam;
        cin>>szam;
        h.push_back(szam);

    }
    for(int i=0;i<N;++i)
    {
        int bal=i-K;
        if(bal<0)
            bal=0;
        int jobb=i+K;
        if(jobb>N)
            jobb=N;
        if(h[i]>=*max_element(h.begin()+bal,h.begin()+i) and h[i]>=*max_element(h.begin()+i,h.begin()+jobb))
        {
            cout<<i;
            return 0;
        }
    }
    cout<<-1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Wrong answer0/01ms316 KiB
2Wrong answer0/04ms316 KiB
3Wrong answer0/21ms508 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/22ms500 KiB
9Wrong answer0/24ms316 KiB
10Wrong answer0/24ms508 KiB
11Wrong answer0/24ms456 KiB
12Wrong answer0/23ms436 KiB
13Time limit exceeded0/2300ms884 KiB
14Time limit exceeded0/2298ms944 KiB
15Time limit exceeded0/2300ms1548 KiB
16Time limit exceeded0/2300ms1420 KiB
17Time limit exceeded0/2280ms1452 KiB
18Time limit exceeded0/2282ms1572 KiB
19Time limit exceeded0/2284ms1456 KiB
20Time limit exceeded0/2284ms944 KiB
21Time limit exceeded0/2289ms1456 KiB
22Time limit exceeded0/2291ms1396 KiB