213252026-01-12 18:28:45mikloshunorFasor (40)cpp17Accepted 40/4071ms1272 KiB
#include <iostream>
#include <vector>
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;
    int i = 1, j;
    while (i <= n)
    {
        hatar = (n < i + k ? n : i + k);
        j = i + 1;
        while (j <= hatar && mfa[i] >= mfa [j])
        {
            j++;
        }
        if (j > hatar)
        {
            cout << i;
            return 0;
        }
        i = j;
    }
    cout << - 1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms500 KiB
2Accepted0/04ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms508 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms404 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/24ms436 KiB
10Accepted2/24ms316 KiB
11Accepted2/24ms356 KiB
12Accepted2/23ms316 KiB
13Accepted2/235ms564 KiB
14Accepted2/232ms796 KiB
15Accepted2/256ms1192 KiB
16Accepted2/264ms1200 KiB
17Accepted2/271ms1200 KiB
18Accepted2/271ms1076 KiB
19Accepted2/271ms1076 KiB
20Accepted2/220ms564 KiB
21Accepted2/256ms1272 KiB
22Accepted2/270ms1076 KiB