128732025-01-02 19:32:39BucsMateFasor (40)cpp17Accepted 40/4043ms584 KiB
#include <iostream>

using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;

    int poz = 1, maxMagassag, hossz = 0;
    cin >> maxMagassag;

    int curr;
    for(int i = 2; i <= N; i++){
        cin >> curr;
        if(curr > maxMagassag){
            maxMagassag = curr;
            hossz = 0;
            poz = i;
        }
        else{
            hossz++;
        }

        if(hossz >= K){
            cout << poz << endl;
            break;
        }
    }
    cout << poz << endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms320 KiB
2Accepted0/01ms320 KiB
3Accepted2/21ms320 KiB
4Accepted2/21ms584 KiB
5Accepted2/21ms320 KiB
6Accepted2/21ms320 KiB
7Accepted2/21ms320 KiB
8Accepted2/21ms348 KiB
9Accepted2/21ms320 KiB
10Accepted2/21ms324 KiB
11Accepted2/21ms500 KiB
12Accepted2/21ms320 KiB
13Accepted2/235ms400 KiB
14Accepted2/232ms400 KiB
15Accepted2/237ms400 KiB
16Accepted2/232ms404 KiB
17Accepted2/243ms500 KiB
18Accepted2/234ms320 KiB
19Accepted2/234ms320 KiB
20Accepted2/220ms320 KiB
21Accepted2/243ms404 KiB
22Accepted2/232ms404 KiB