171282025-05-24 11:58:03SaroltaMihalyKerékpártúra (50 pont)cpp17Wrong answer 0/504ms564 KiB
#include <iostream>
using namespace std;
int main()
{
	int N, max_hossz = -1, max_poz = -1, max = 0, jel_hossz = 0, x;
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> x;
		if (x < max)
			jel_hossz++;
		else
		{
			max = x;
			if (max_hossz < jel_hossz)
			{
				max_hossz = jel_hossz;
				max_poz = i + 1;
			}
		}
	}

	cout << max_poz;
	return 0;
}


SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/04ms564 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms500 KiB
9Wrong answer0/21ms412 KiB
10Wrong answer0/21ms316 KiB
11Wrong answer0/21ms416 KiB
12Wrong answer0/21ms508 KiB
13Wrong answer0/21ms508 KiB
14Wrong answer0/21ms416 KiB
15Wrong answer0/34ms548 KiB
16Wrong answer0/44ms316 KiB
17Wrong answer0/44ms388 KiB
18Wrong answer0/34ms500 KiB
19Wrong answer0/34ms416 KiB
20Wrong answer0/34ms564 KiB
21Wrong answer0/34ms316 KiB
22Wrong answer0/34ms316 KiB