185102025-10-24 20:50:05Teret222Fasor (40)cpp17Wrong answer 0/4071ms1264 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
	int n, k, i = 0, f = -1, j = 1;
	cin >> n >> k;
	vector<int>list(n, 0);
	for (int i = 0; i < n; i++)
	{
		cin >> list[i];
	}

	while (i < n and f == -1)
	{
		j = 1;
		while (j + i < n and j <= k and list[i + j] <= list[i])
			j++;
		if (j == k + 1)
		{
			j = 1;
			while (i - j > 0 and j <= k and list[i - j] <= list[i])
				j++;
			if (j == k)
				f = i + 1;
			else
				i = i + j;
		}
		else
			i = i + j;
	}

	cout << f;
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/01ms500 KiB
2Wrong answer0/04ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms384 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/22ms328 KiB
9Wrong answer0/24ms440 KiB
10Wrong answer0/24ms316 KiB
11Wrong answer0/24ms436 KiB
12Wrong answer0/23ms316 KiB
13Wrong answer0/237ms564 KiB
14Wrong answer0/234ms804 KiB
15Wrong answer0/257ms1076 KiB
16Wrong answer0/264ms1192 KiB
17Wrong answer0/271ms1076 KiB
18Wrong answer0/271ms1192 KiB
19Wrong answer0/271ms1192 KiB
20Wrong answer0/220ms652 KiB
21Wrong answer0/257ms1076 KiB
22Wrong answer0/271ms1264 KiB