185072025-10-24 20:31:51Teret222Fasor (40)cpp17Wrong answer 34/4071ms1260 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)
			f = i + 1;
		else
			i = i + j;
	}

	cout << f;
}
SubtaskSumTestVerdictTimeMemory
base34/40
1Accepted0/01ms316 KiB
2Accepted0/04ms500 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms380 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms352 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms316 KiB
11Accepted2/24ms316 KiB
12Accepted2/23ms316 KiB
13Accepted2/235ms804 KiB
14Wrong answer0/235ms804 KiB
15Accepted2/254ms1076 KiB
16Accepted2/264ms1196 KiB
17Accepted2/271ms1260 KiB
18Accepted2/271ms1088 KiB
19Accepted2/271ms1076 KiB
20Wrong answer0/220ms644 KiB
21Accepted2/256ms1116 KiB
22Accepted2/271ms1260 KiB