219782026-01-14 12:10:59VizsimiKét ajándékpython3Accepted 100/10054ms7072 KiB
N = int(input())
prizes = input().split()
for i in range(N):
  prizes[i] = int(prizes[i])
highest_amount = [0, 0, 0] #összeg, első, második
highest = 0
highest_place = 0
true = False

for i in range(N-2, -1, -1):
    if prizes[i] > highest:
        highest = prizes[i]
        highest_place = i
    else:
        if prizes[i] + highest > highest_amount[0]:
            true = True
            highest_amount[0] = prizes[i] + highest
            highest_amount[1] = highest_place
            highest_amount[2] = i
if true:
    print(highest_amount[2] + 1, highest_amount[1] + 1)
else:
    print(0, 0)
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted17ms3124 KiB
2Accepted43ms6104 KiB
subtask210/10
3Accepted14ms3148 KiB
4Accepted14ms3124 KiB
5Accepted14ms3124 KiB
6Accepted14ms2940 KiB
7Accepted14ms3124 KiB
subtask310/10
8Accepted14ms3124 KiB
9Accepted16ms3144 KiB
10Accepted14ms3116 KiB
11Accepted14ms3124 KiB
12Accepted14ms3124 KiB
subtask420/20
13Accepted14ms3124 KiB
14Accepted14ms3124 KiB
15Accepted16ms3124 KiB
16Accepted16ms3108 KiB
17Accepted16ms3124 KiB
18Accepted14ms3124 KiB
19Accepted17ms2988 KiB
20Accepted16ms3020 KiB
21Accepted16ms3144 KiB
22Accepted16ms3120 KiB
subtask510/10
23Accepted18ms3384 KiB
24Accepted18ms3040 KiB
25Accepted19ms3376 KiB
26Accepted19ms3476 KiB
27Accepted24ms3652 KiB
subtask610/10
28Accepted23ms4088 KiB
29Accepted21ms3920 KiB
30Accepted23ms3920 KiB
31Accepted23ms3892 KiB
32Accepted21ms3892 KiB
subtask710/10
33Accepted37ms5624 KiB
34Accepted35ms5416 KiB
35Accepted35ms5420 KiB
36Accepted37ms5616 KiB
37Accepted35ms5624 KiB
subtask830/30
38Accepted43ms6288 KiB
39Accepted46ms6228 KiB
40Accepted48ms6360 KiB
41Accepted48ms6588 KiB
42Accepted48ms6920 KiB
43Accepted50ms6936 KiB
44Accepted52ms6832 KiB
45Accepted52ms7016 KiB
46Accepted50ms7032 KiB
47Accepted52ms6988 KiB
48Accepted50ms7028 KiB
49Accepted54ms7072 KiB
50Accepted52ms7028 KiB
51Accepted48ms6848 KiB
52Accepted50ms7028 KiB