241052026-02-04 12:15:29VizsimiÉrdekes túra (70 pont)python3Wrong answer 0/70485ms32000 KiB
N = int(input())
hike = input().split()
longest = -1
current = []
sum = 0

for i in range(N):
    hike[i] = int(hike[i])

for i in range(N):
    print(current)
    if len(current) == 0:
        current.append(hike[i])
    else:
        if current[len(current) - 1] == hike[i] and len(current) > 1:
            sum += 1
            if len(current) > longest:
                longest = len(current)
                current.clear()
        else:
            current.append(hike[i])
print(sum)
print(longest)
SubtaskSumTestVerdictTimeMemory
base0/70
1Wrong answer0/016ms3124 KiB
2Time limit exceeded0/0483ms31156 KiB
3Wrong answer0/316ms3120 KiB
4Wrong answer0/316ms2932 KiB
5Wrong answer0/316ms2976 KiB
6Wrong answer0/317ms2952 KiB
7Wrong answer0/316ms3016 KiB
8Wrong answer0/316ms3124 KiB
9Wrong answer0/328ms3636 KiB
10Wrong answer0/348ms4536 KiB
11Wrong answer0/386ms6116 KiB
12Wrong answer0/3180ms10336 KiB
13Wrong answer0/4210ms12340 KiB
14Time limit exceeded0/4485ms30956 KiB
15Time limit exceeded0/4485ms32000 KiB
16Time limit exceeded0/4483ms29228 KiB
17Time limit exceeded0/4479ms31760 KiB
18Time limit exceeded0/4476ms29140 KiB
19Time limit exceeded0/4477ms32000 KiB
20Time limit exceeded0/4483ms30272 KiB
21Time limit exceeded0/4485ms32000 KiB
22Time limit exceeded0/4485ms30836 KiB