Submission #17,289

2025-06-17 14:58:26

pypy3

Accepted 45/45

65ms

21492 KiB

# UUID: f7d29adf-51ff-46e6-a6d3-039e41e3bdd1
n = int(input())
g = [int(input()) for i in range(n)]
mx = max(g)
print(mx)
print(g.count(mx))
for i in range(len(g)):
    if g[i] == mx:
        print(i + 1)

	Sum	Test	Verdict		Time	Memory
base	45/45
		1	Accepted	0/0	39ms	19440 KiB
		2	Accepted	0/0	65ms	21376 KiB
		3	Accepted	3/3	46ms	19312 KiB
		4	Accepted	3/3	45ms	19388 KiB
		5	Accepted	3/3	39ms	19420 KiB
		6	Accepted	3/3	39ms	19448 KiB
		7	Accepted	3/3	45ms	19436 KiB
		8	Accepted	3/3	46ms	19848 KiB
		9	Accepted	3/3	45ms	19496 KiB
		10	Accepted	3/3	63ms	21264 KiB
		11	Accepted	3/3	59ms	21492 KiB
		12	Accepted	3/3	52ms	21016 KiB
		13	Accepted	3/3	54ms	21044 KiB
		14	Accepted	3/3	56ms	21280 KiB
		15	Accepted	3/3	57ms	21276 KiB
		16	Accepted	3/3	64ms	21476 KiB
		17	Accepted	3/3	63ms	21480 KiB