134622025-01-08 07:48:23GundischBalazsFasor (40)cpp17Accepted 40/4045ms512 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, k,maxi=0,db=0,x,mi=1;
    cin >> n >> k;
    cin >> maxi;
   for(int i=2; i<=n; i++){
        cin >> x;
        db++;
        if(x > maxi){
            maxi = x;
            mi = i;
            db=0;
        }
        if(db>=k){
            break;
        }
    }
    cout << mi;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms400 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms316 KiB
12Accepted2/21ms316 KiB
13Accepted2/237ms396 KiB
14Accepted2/234ms400 KiB
15Accepted2/239ms316 KiB
16Accepted2/232ms396 KiB
17Accepted2/243ms316 KiB
18Accepted2/234ms316 KiB
19Accepted2/234ms404 KiB
20Accepted2/221ms400 KiB
21Accepted2/245ms512 KiB
22Accepted2/232ms404 KiB