Submission #6,338

2023-11-20 11:13:53

cpp17

Wrong answer 34/40

72ms

16384 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 << -1;
}
//10 3
//6 2 1 8 4 8 7 12 9 3

	Sum	Test	Verdict		Time	Memory
base	34/40
		1	Accepted	0/0	3ms	1812 KiB
		2	Accepted	0/0	4ms	2224 KiB
		3	Accepted	2/2	3ms	2164 KiB
		4	Wrong answer	0/2	3ms	2388 KiB
		5	Accepted	2/2	3ms	2592 KiB
		6	Accepted	2/2	3ms	2832 KiB
		7	Accepted	2/2	3ms	3048 KiB
		8	Accepted	2/2	3ms	3412 KiB
		9	Accepted	2/2	6ms	3712 KiB
		10	Accepted	2/2	6ms	3872 KiB
		11	Accepted	2/2	6ms	4060 KiB
		12	Accepted	2/2	4ms	4252 KiB
		13	Accepted	2/2	37ms	5552 KiB
		14	Wrong answer	0/2	35ms	6420 KiB
		15	Accepted	2/2	57ms	7960 KiB
		16	Accepted	2/2	67ms	9428 KiB
		17	Accepted	2/2	72ms	10948 KiB
		18	Accepted	2/2	72ms	12420 KiB
		19	Accepted	2/2	72ms	13676 KiB
		20	Wrong answer	0/2	21ms	13512 KiB
		21	Accepted	2/2	57ms	15020 KiB
		22	Accepted	2/2	71ms	16384 KiB