173022025-06-20 16:48:05algoproAranycipők (45)pypy3Accepted 45/4567ms21492 KiB
# UUID: 3aacbe65-9c78-4b53-a02c-b2f224aadb50
n = int(input())
golok = []
for i in range(n):
    gol = int(input())
    golok.append(gol)
maxi = max(golok)
cipo = []
for i in range(n):
    if golok[i] == maxi:
        cipo.append(i+1)
print(maxi)
print(len(cipo))
for i in cipo:
    print(i)
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/043ms19648 KiB
2Accepted0/065ms21440 KiB
3Accepted3/339ms19404 KiB
4Accepted3/339ms19404 KiB
5Accepted3/339ms19436 KiB
6Accepted3/345ms19452 KiB
7Accepted3/346ms19480 KiB
8Accepted3/341ms19752 KiB
9Accepted3/346ms19436 KiB
10Accepted3/364ms21440 KiB
11Accepted3/359ms21304 KiB
12Accepted3/345ms21104 KiB
13Accepted3/354ms21120 KiB
14Accepted3/354ms21472 KiB
15Accepted3/357ms21492 KiB
16Accepted3/365ms21480 KiB
17Accepted3/367ms21480 KiB