213142026-01-12 18:22:11ZsoltFasor (40)cpp17Wrong answer 0/4071ms1260 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,k;
    cin>>n>>k;
    vector<int>mfa(n+1);
    for(int i=1; i<=n; i++)
    {
        cin>>mfa[i];
    }
    int hatar,i=1,j;
    while(i<=n)
    {
        hatar=(n<i+k ? n: i+k);
        j=i+1;
        while(j<=i+k && mfa[i]<=mfa[j])
        {
            j++;
        }
        if(j>i+k)
        {
            cout<<i+1;
            return 0;
        }
        i=j;
    }
    cout<<-1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/01ms316 KiB
2Wrong answer0/04ms500 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/22ms412 KiB
9Wrong answer0/24ms316 KiB
10Wrong answer0/24ms316 KiB
11Wrong answer0/24ms316 KiB
12Wrong answer0/23ms432 KiB
13Wrong answer0/235ms652 KiB
14Wrong answer0/232ms564 KiB
15Wrong answer0/254ms1196 KiB
16Wrong answer0/264ms1064 KiB
17Wrong answer0/271ms1076 KiB
18Wrong answer0/271ms1076 KiB
19Wrong answer0/271ms1188 KiB
20Wrong answer0/219ms564 KiB
21Wrong answer0/256ms1260 KiB
22Wrong answer0/270ms1192 KiB