175312025-07-18 11:39:17algoproAranycipők (45)pypy3Accepted 45/4571ms21480 KiB
# UUID: 943a5c67-ac39-49f8-83c9-6b30f54730b4
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/045ms19472 KiB
2Accepted0/065ms21372 KiB
3Accepted3/339ms19304 KiB
4Accepted3/343ms19380 KiB
5Accepted3/341ms19300 KiB
6Accepted3/345ms19432 KiB
7Accepted3/345ms19504 KiB
8Accepted3/341ms19872 KiB
9Accepted3/339ms19436 KiB
10Accepted3/364ms21460 KiB
11Accepted3/364ms21272 KiB
12Accepted3/346ms21004 KiB
13Accepted3/356ms21228 KiB
14Accepted3/354ms21232 KiB
15Accepted3/371ms21404 KiB
16Accepted3/365ms21312 KiB
17Accepted3/368ms21480 KiB