136182025-01-08 11:26:41kongopongFasor (40)cpp17Accepted 40/4075ms1196 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k, x=0, mx=0;
    cin >> n >> k;
    vector <int> v;
    v.resize(n);
    for(int i=1; i<=n; i++)
    {
        cin >> v[i-1];
        if(v[i-1]>mx && (i-1-x<=k))
        {
            mx=v[i-1];
            x=i-1;
        }
    }
    cout << x+1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/04ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms316 KiB
9Accepted2/24ms436 KiB
10Accepted2/24ms508 KiB
11Accepted2/24ms432 KiB
12Accepted2/23ms316 KiB
13Accepted2/237ms564 KiB
14Accepted2/234ms564 KiB
15Accepted2/259ms1192 KiB
16Accepted2/268ms1076 KiB
17Accepted2/275ms1196 KiB
18Accepted2/274ms1076 KiB
19Accepted2/274ms1076 KiB
20Accepted2/221ms564 KiB
21Accepted2/259ms1196 KiB
22Accepted2/272ms1076 KiB