233762026-01-20 19:41:22BalázsFasor (40)cpp17Wrong answer 0/4071ms1200 KiB
#include <iostream>
#include<bits/stdc++.h>

using namespace std;

int main()
{   int eddigi_max=0;
    int n,k;
    cin>>n>>k;
    vector<int>fasor(n);
    for (int i=0; i<n; i++){
        cin>>fasor[i];
    }
    for (int i=0; i<fasor.size();i++){
        for(int j=1; j<=k; j++){
            if(fasor[i]<fasor[i+j]){
                eddigi_max=i+j;
                if(eddigi_max-i>=k){
                    cout<<i+j+1;
                    return 0;
                }
            }
        }
    }
    cout<<"1";


    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/01ms316 KiB
2Wrong answer0/04ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms336 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/24ms316 KiB
10Wrong answer0/24ms316 KiB
11Wrong answer0/24ms316 KiB
12Wrong answer0/23ms316 KiB
13Wrong answer0/235ms564 KiB
14Runtime error0/232ms804 KiB
15Wrong answer0/256ms1164 KiB
16Wrong answer0/268ms1200 KiB
17Wrong answer0/271ms1080 KiB
18Wrong answer0/271ms1192 KiB
19Wrong answer0/271ms1196 KiB
20Wrong answer0/220ms824 KiB
21Wrong answer0/257ms1076 KiB
22Wrong answer0/271ms1076 KiB