256722026-02-24 17:29:47algoproBejgli (80 pont)pypy3Accepted 80/8075ms33620 KiB
# UUID: f125293f-319e-44d5-a110-f1f1cf4407f0
n = int(input())
l = list(map(int, input().split()))

hist = [0] * (n+1)

i = 0
slices = 0
while i < n:
    length = l[i]
    hist[length] += 1
    slices += 1
    i += length

print(slices)
print(hist.index(max(hist)))
SubtaskSumTestVerdictTimeMemory
base80/80
1Accepted0/039ms19688 KiB
2Accepted0/043ms19368 KiB
3Accepted4/443ms19492 KiB
4Accepted4/439ms19468 KiB
5Accepted4/446ms19476 KiB
6Accepted4/443ms19428 KiB
7Accepted4/439ms19424 KiB
8Accepted4/437ms19488 KiB
9Accepted4/439ms19692 KiB
10Accepted4/445ms21484 KiB
11Accepted4/452ms21492 KiB
12Accepted4/452ms21680 KiB
13Accepted4/446ms21584 KiB
14Accepted4/452ms21544 KiB
15Accepted4/452ms21648 KiB
16Accepted4/448ms22608 KiB
17Accepted4/465ms28392 KiB
18Accepted4/465ms33272 KiB
19Accepted4/464ms33312 KiB
20Accepted4/474ms33296 KiB
21Accepted4/475ms33620 KiB
22Accepted4/464ms33328 KiB