6339 | 2023. 11. 20 11:17:57 | Gervid | Fasor (40) | cpp17 | Elfogadva 40/40 | 72ms | 5456 KiB |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n, k, i, j;
cin >> n >> k;
vector<unsigned int> trees(n);
for (i = 0; i < n; i++)
{
cin >> trees[i];
}
int max = trees[0], maxi = 0;
for (i = 1; i < n; i++)
{
if (i - maxi > k)
{
cout << maxi + 1;
return 0;
}
if (trees[i] > max)
{
max = trees[i];
maxi = i;
continue;
}
}
cout << maxi + 1;
}
//10 1
//1 2 1 8 4 8 7 12 9 3
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 40/40 | ||||||
1 | Elfogadva | 0/0 | 3ms | 1808 KiB | |||
2 | Elfogadva | 0/0 | 4ms | 2228 KiB | |||
3 | Elfogadva | 2/2 | 2ms | 2088 KiB | |||
4 | Elfogadva | 2/2 | 3ms | 2332 KiB | |||
5 | Elfogadva | 2/2 | 3ms | 2580 KiB | |||
6 | Elfogadva | 2/2 | 3ms | 2840 KiB | |||
7 | Elfogadva | 2/2 | 3ms | 3028 KiB | |||
8 | Elfogadva | 2/2 | 3ms | 3212 KiB | |||
9 | Elfogadva | 2/2 | 4ms | 3492 KiB | |||
10 | Elfogadva | 2/2 | 6ms | 3708 KiB | |||
11 | Elfogadva | 2/2 | 6ms | 3836 KiB | |||
12 | Elfogadva | 2/2 | 4ms | 3572 KiB | |||
13 | Elfogadva | 2/2 | 37ms | 4584 KiB | |||
14 | Elfogadva | 2/2 | 34ms | 4324 KiB | |||
15 | Elfogadva | 2/2 | 56ms | 4976 KiB | |||
16 | Elfogadva | 2/2 | 65ms | 5252 KiB | |||
17 | Elfogadva | 2/2 | 72ms | 5324 KiB | |||
18 | Elfogadva | 2/2 | 71ms | 5456 KiB | |||
19 | Elfogadva | 2/2 | 71ms | 5356 KiB | |||
20 | Elfogadva | 2/2 | 21ms | 4788 KiB | |||
21 | Elfogadva | 2/2 | 57ms | 5436 KiB | |||
22 | Elfogadva | 2/2 | 72ms | 5436 KiB |