2577 | 2023. 01. 17 15:26:45 | Nandikaa | Fasor (40) | cpp11 | Accepted 40/40 | 74ms | 5332 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 rosszhely;
for (int i = 0; i < n; i++){
rosszhely=false;
for (int j=i-d; j <= i+d;j++){
if (j >= 0 && j<n){
if (fasor[j] > fasor[i]){
i=j-1;
rosszhely = true;
break;
}
}
}
if (rosszhely == false){
cout << i+1;
return 0;
}
}
cout << "-1";
return 0;
}
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
base | 40/40 | ||||||
1 | Accepted | 0/0 | 3ms | 1748 KiB | |||
2 | Accepted | 0/0 | 4ms | 2036 KiB | |||
3 | Accepted | 2/2 | 2ms | 2076 KiB | |||
4 | Accepted | 2/2 | 2ms | 2240 KiB | |||
5 | Accepted | 2/2 | 2ms | 2440 KiB | |||
6 | Accepted | 2/2 | 2ms | 2552 KiB | |||
7 | Accepted | 2/2 | 2ms | 2664 KiB | |||
8 | Accepted | 2/2 | 3ms | 2872 KiB | |||
9 | Accepted | 2/2 | 4ms | 2976 KiB | |||
10 | Accepted | 2/2 | 6ms | 3064 KiB | |||
11 | Accepted | 2/2 | 6ms | 2980 KiB | |||
12 | Accepted | 2/2 | 4ms | 3108 KiB | |||
13 | Accepted | 2/2 | 37ms | 3924 KiB | |||
14 | Accepted | 2/2 | 37ms | 3920 KiB | |||
15 | Accepted | 2/2 | 57ms | 4808 KiB | |||
16 | Accepted | 2/2 | 67ms | 4816 KiB | |||
17 | Accepted | 2/2 | 72ms | 4932 KiB | |||
18 | Accepted | 2/2 | 72ms | 5060 KiB | |||
19 | Accepted | 2/2 | 74ms | 5152 KiB | |||
20 | Accepted | 2/2 | 23ms | 4432 KiB | |||
21 | Accepted | 2/2 | 59ms | 5228 KiB | |||
22 | Accepted | 2/2 | 72ms | 5332 KiB |