146322025-01-21 19:32:32farkasrekaLegcsalódottabb versenyző (75 pont)pypy3Accepted 75/7590ms31468 KiB
from sys import stdin

N = int(stdin.readline())
a = [int(x) for x in stdin.readline().split()]
verem = []
ido = [-1] * N
a.reverse()
for i in range(N):
	while len(verem) > 0 and verem[-1][0] <= a[i]:
		verem.pop(-1)
	if len(verem) > 0:
		ido[i] = i - verem[-1][1]
	verem.append((a[i],i))
ido.reverse()
a.reverse()
max_ido = -1
max_pont = -1
legcsalodottabb = -1
for j in range(N):
	pont = a[j]
	if pont > max_pont:
		max_pont = pont
		if ido[j] > max_ido:
			max_ido = ido[j]
			legcsalodottabb = j+1
print(legcsalodottabb)
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/041ms19672 KiB
2Accepted0/086ms31304 KiB
3Accepted5/539ms19392 KiB
4Accepted5/539ms19416 KiB
5Accepted5/539ms19436 KiB
6Accepted5/539ms19428 KiB
7Accepted5/543ms19552 KiB
8Accepted5/545ms19688 KiB
9Accepted5/539ms19948 KiB
10Accepted5/539ms19960 KiB
11Accepted5/548ms21228 KiB
12Accepted5/550ms21036 KiB
13Accepted5/590ms31444 KiB
14Accepted5/586ms31260 KiB
15Accepted5/576ms31280 KiB
16Accepted5/575ms31432 KiB
17Accepted5/583ms31468 KiB