175322025-07-18 11:46:09algoproAranycipők (45)pypy3Accepted 45/4568ms21472 KiB
# UUID: 24e5d444-1aea-462e-8078-47bd505a36a5
n = int(input())

golok = []
for _ in range(n):
    gol = int(input())
    golok.append(gol)

max_gol = golok[0]
for i in range(1, n):
    if golok[i] > max_gol:
        max_gol = golok[i]

sorszamok = []
for i in range(n):
    if golok[i] == max_gol:
        sorszamok.append(i + 1)

print(max_gol)
print(len(sorszamok))
for sorszam in sorszamok:
    print(sorszam)
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/039ms19600 KiB
2Accepted0/064ms21460 KiB
3Accepted3/339ms19412 KiB
4Accepted3/343ms19420 KiB
5Accepted3/345ms19400 KiB
6Accepted3/345ms19392 KiB
7Accepted3/339ms19380 KiB
8Accepted3/341ms19748 KiB
9Accepted3/345ms19432 KiB
10Accepted3/357ms21440 KiB
11Accepted3/364ms21464 KiB
12Accepted3/345ms21208 KiB
13Accepted3/348ms21040 KiB
14Accepted3/354ms21352 KiB
15Accepted3/364ms21348 KiB
16Accepted3/365ms21452 KiB
17Accepted3/368ms21472 KiB