146332025-01-21 19:34:50farkasrekaLegcsalódottabb versenyző (75 pont)pypy3Accepted 75/7586ms31468 KiB
from sys import stdin

N = int(stdin.readline())
a = [int(x) for x in stdin.readline().split()]
verem = []
ido = [-1] * N
for i in range(N-1, -1, -1):
	while len(verem) > 0 and verem[-1][0] <= a[i]:
		verem.pop(-1)
	if len(verem) > 0:
		ido[i] = verem[-1][1] - i
	verem.append((a[i],i))
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/037ms19520 KiB
2Accepted0/086ms31336 KiB
3Accepted5/537ms19484 KiB
4Accepted5/537ms19556 KiB
5Accepted5/543ms19324 KiB
6Accepted5/537ms19416 KiB
7Accepted5/537ms19420 KiB
8Accepted5/545ms19692 KiB
9Accepted5/539ms19812 KiB
10Accepted5/546ms19896 KiB
11Accepted5/543ms21172 KiB
12Accepted5/550ms21264 KiB
13Accepted5/582ms31468 KiB
14Accepted5/576ms31336 KiB
15Accepted5/586ms31352 KiB
16Accepted5/585ms31468 KiB
17Accepted5/575ms31284 KiB