172932025-06-17 17:05:10algoproAranycipők (45)pypy3Accepted 45/4567ms21708 KiB
# UUID: 2cf2a852-4933-4e68-8906-b72005cd9aa8
n=int(input())
a=[int(input())for o in range(n)]
b=max(a)
print(b)
print(a.count(b))
for i in range(len(a)):
    if a[i]==b:
        print(i+1)
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/045ms19432 KiB
2Accepted0/059ms21440 KiB
3Accepted3/339ms19348 KiB
4Accepted3/343ms19392 KiB
5Accepted3/348ms19440 KiB
6Accepted3/343ms19288 KiB
7Accepted3/339ms19384 KiB
8Accepted3/341ms19604 KiB
9Accepted3/339ms19552 KiB
10Accepted3/363ms21708 KiB
11Accepted3/364ms21360 KiB
12Accepted3/343ms21088 KiB
13Accepted3/354ms21248 KiB
14Accepted3/359ms21472 KiB
15Accepted3/359ms21316 KiB
16Accepted3/359ms21428 KiB
17Accepted3/367ms21528 KiB