132652025-01-07 11:22:25AGergoFasor (40)cpp17Accepted 40/4045ms508 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    int cur,d=k,next,pos=1;
    cin >> cur;
    bool done = false;

    for(int i = 1; i < n; i++)
    {
        cin >> next;
        if(next <= cur)
        {
            d--;
            if(d==0)
            {
                cout << pos;
                done = true;
                break;
            }
        }
        else
        {
            d=k;
            cur = next;
            pos = i+1;
        }

    }
    if(!done)
    {
        cout << pos;
    }
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms508 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms316 KiB
12Accepted2/21ms348 KiB
13Accepted2/235ms404 KiB
14Accepted2/234ms400 KiB
15Accepted2/239ms400 KiB
16Accepted2/232ms396 KiB
17Accepted2/243ms400 KiB
18Accepted2/232ms400 KiB
19Accepted2/234ms400 KiB
20Accepted2/220ms400 KiB
21Accepted2/245ms396 KiB
22Accepted2/232ms316 KiB