163752025-04-29 10:10:15algoproKéséspypy3Accepted 50/50143ms62748 KiB
# UUID: c51dcf21-65e0-4bee-af16-f73e08adeac9
n = int(input())
e = [int(x) for x in input().split()]

s = set()
ans = 0
for i in range(n-1, -1, -1):
    if e[i] not in s:
        ans = i + 1
    s.add(e[i])
print(ans)
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/039ms19392 KiB
2Accepted0/054ms22500 KiB
3Accepted5/546ms19796 KiB
4Accepted5/546ms19908 KiB
5Accepted5/5101ms39328 KiB
6Accepted5/589ms39336 KiB
7Accepted4/4108ms52440 KiB
8Accepted4/4123ms52584 KiB
9Accepted4/4107ms50364 KiB
10Accepted4/4120ms48652 KiB
11Accepted4/4101ms45656 KiB
12Accepted2/2129ms52416 KiB
13Accepted2/2128ms62748 KiB
14Accepted1/1128ms62732 KiB
15Accepted1/1143ms62660 KiB
16Accepted1/1140ms59972 KiB
17Accepted1/1112ms53740 KiB
18Accepted1/197ms44332 KiB
19Accepted1/1109ms44420 KiB