2578 2023. 01. 17 15:26:53 Krisztian Fasor (40) cpp11 Accepted 40/40 72ms 6172 KiB 
#include <iostream>

using namespace std;

int main()
{
    int n;
    int d;
    cin>>n;
    cin>>d;

    int fasor[n];
    for(int i=0; i<n; i++){
        cin>>fasor[i];
    }

    bool rossz_hely;
    for(int i=0; i<n; i++){
            rossz_hely=false;
            for(int j=i-d; j<=i+d;j++){
                if(j>=0 && j<n){
                    if(fasor [j]> fasor[i]){
                        i = j-1; // tovabblepek a maxra
                        rossz_hely=true;
                        break;

                }
                }
            }
            if (rossz_hely==false){
                cout<<i+1;
                return 0;
            }

    }





    return 0;
}
Subtask Sum Test Verdict Time Memory
base 40/40
1 Accepted 0/0 3ms 1876 KiB
2 Accepted 0/0 4ms 2104 KiB
3 Accepted 2/2 2ms 2272 KiB
4 Accepted 2/2 2ms 2480 KiB
5 Accepted 2/2 2ms 2828 KiB
6 Accepted 2/2 2ms 2824 KiB
7 Accepted 2/2 2ms 2892 KiB
8 Accepted 2/2 3ms 3028 KiB
9 Accepted 2/2 4ms 3136 KiB
10 Accepted 2/2 6ms 3136 KiB
11 Accepted 2/2 6ms 3328 KiB
12 Accepted 2/2 4ms 3408 KiB
13 Accepted 2/2 37ms 4268 KiB
14 Accepted 2/2 37ms 4504 KiB
15 Accepted 2/2 57ms 5324 KiB
16 Accepted 2/2 65ms 5320 KiB
17 Accepted 2/2 72ms 5452 KiB
18 Accepted 2/2 71ms 5656 KiB
19 Accepted 2/2 71ms 5856 KiB
20 Accepted 2/2 23ms 5160 KiB
21 Accepted 2/2 59ms 6060 KiB
22 Accepted 2/2 71ms 6172 KiB