256732026-02-24 17:30:58algoproBejgli (80 pont)pypy3Wrong answer 44/8079ms32976 KiB
# UUID: f8621f9a-224f-4f20-9abc-3f8bb2a05021
n = int(input())
a = list(map(int, input().split()))
szeletek = 0
db = {}
i = 0
while i < n:
    hossz = a[i]
    szeletek += 1
    db[hossz] = db.get(hossz, 0) + 1
    while i < n and a[i] == hossz:
        i += 1
print(szeletek)
print(max(db, key=db.get))
SubtaskSumTestVerdictTimeMemory
base44/80
1Wrong answer0/043ms19520 KiB
2Wrong answer0/039ms19356 KiB
3Accepted4/443ms19292 KiB
4Accepted4/439ms19288 KiB
5Partially correct2/446ms19436 KiB
6Accepted4/439ms19436 KiB
7Partially correct2/437ms19496 KiB
8Partially correct2/443ms19740 KiB
9Partially correct2/446ms19912 KiB
10Partially correct2/454ms21588 KiB
11Partially correct2/448ms21608 KiB
12Partially correct2/448ms21548 KiB
13Partially correct2/456ms21652 KiB
14Wrong answer0/454ms21600 KiB
15Partially correct2/448ms21732 KiB
16Partially correct2/448ms22672 KiB
17Partially correct2/459ms28472 KiB
18Partially correct2/475ms32636 KiB
19Partially correct2/479ms32596 KiB
20Partially correct2/465ms32648 KiB
21Partially correct2/476ms32976 KiB
22Partially correct2/465ms32360 KiB