219762026-01-14 12:08:22VizsimiKét ajándékpython3Wrong answer 80/10054ms7112 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

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]:
            highest_amount[0] = prizes[i] + highest
            highest_amount[1] = highest_place
            highest_amount[2] = i
print(highest_amount[2] + 1, highest_amount[1] + 1)
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted17ms3124 KiB
2Accepted43ms5976 KiB
subtask210/10
3Accepted17ms3100 KiB
4Accepted16ms3312 KiB
5Accepted16ms3124 KiB
6Accepted16ms3124 KiB
7Accepted14ms3004 KiB
subtask310/10
8Accepted16ms3136 KiB
9Accepted16ms2908 KiB
10Accepted16ms2888 KiB
11Accepted17ms3124 KiB
12Accepted16ms2916 KiB
subtask40/20
13Accepted16ms3120 KiB
14Wrong answer16ms3120 KiB
15Accepted16ms3460 KiB
16Accepted16ms3112 KiB
17Accepted16ms3124 KiB
18Accepted14ms2968 KiB
19Accepted16ms3064 KiB
20Accepted16ms2932 KiB
21Accepted16ms2984 KiB
22Accepted16ms3156 KiB
subtask510/10
23Accepted18ms3380 KiB
24Accepted18ms3120 KiB
25Accepted19ms3568 KiB
26Accepted19ms3380 KiB
27Accepted21ms3784 KiB
subtask610/10
28Accepted23ms3792 KiB
29Accepted21ms3896 KiB
30Accepted24ms3844 KiB
31Accepted24ms3892 KiB
32Accepted24ms3980 KiB
subtask710/10
33Accepted37ms5428 KiB
34Accepted35ms5616 KiB
35Accepted37ms5420 KiB
36Accepted35ms5428 KiB
37Accepted35ms5292 KiB
subtask830/30
38Accepted46ms6172 KiB
39Accepted46ms6364 KiB
40Accepted46ms6360 KiB
41Accepted46ms6588 KiB
42Accepted46ms7112 KiB
43Accepted52ms7020 KiB
44Accepted52ms7020 KiB
45Accepted52ms7024 KiB
46Accepted50ms7028 KiB
47Accepted52ms6980 KiB
48Accepted50ms6944 KiB
49Accepted50ms6988 KiB
50Accepted54ms7028 KiB
51Accepted50ms7028 KiB
52Accepted50ms6988 KiB