189102025-11-11 12:16:37birozsKét ajándékpython3Accepted 100/10072ms9020 KiB
N = int(input())
T = list(map(int,input().split()))
vanmegoldas = False
for i in range(N-1):
    if T[i] < T[i+1]:
        vanmegoldas = True
        break
if vanmegoldas:
    maxertek = 0
    JobbraMax = [0] * N
    JobbraMax[-1] = T[-1]
    for i in range(N-2,-1,-1):
        JobbraMax[i] = max([T[i],JobbraMax[i+1]])
    for i in range(N-1):
        if T[i] < JobbraMax[i] and T[i] + JobbraMax[i] > maxertek:
            maxertek = T[i] + JobbraMax[i]
            p = i + 1
            q = JobbraMax[i]
    for i in range(N-1,-1,-1):
        if T[i] == q:
            print(p,i+1)
            break

else:
    print(0,0)
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted16ms3320 KiB
2Accepted61ms7400 KiB
subtask210/10
3Accepted16ms3112 KiB
4Accepted16ms3124 KiB
5Accepted16ms3320 KiB
6Accepted16ms3124 KiB
7Accepted16ms3136 KiB
subtask310/10
8Accepted16ms3144 KiB
9Accepted16ms3124 KiB
10Accepted16ms3128 KiB
11Accepted16ms3128 KiB
12Accepted16ms3140 KiB
subtask420/20
13Accepted16ms3124 KiB
14Accepted14ms3124 KiB
15Accepted16ms3068 KiB
16Accepted16ms3136 KiB
17Accepted17ms3128 KiB
18Accepted16ms3124 KiB
19Accepted16ms3140 KiB
20Accepted16ms3132 KiB
21Accepted16ms3320 KiB
22Accepted16ms3164 KiB
subtask510/10
23Accepted19ms3424 KiB
24Accepted19ms3208 KiB
25Accepted21ms3440 KiB
26Accepted23ms3652 KiB
27Accepted26ms3844 KiB
subtask610/10
28Accepted26ms4212 KiB
29Accepted27ms4180 KiB
30Accepted26ms4144 KiB
31Accepted27ms4208 KiB
32Accepted27ms4328 KiB
subtask710/10
33Accepted48ms6648 KiB
34Accepted48ms6600 KiB
35Accepted46ms6452 KiB
36Accepted48ms6452 KiB
37Accepted46ms6468 KiB
subtask830/30
38Accepted57ms7496 KiB
39Accepted59ms7552 KiB
40Accepted67ms7776 KiB
41Accepted61ms8236 KiB
42Accepted65ms8336 KiB
43Accepted71ms8908 KiB
44Accepted67ms9020 KiB
45Accepted71ms9004 KiB
46Accepted70ms8784 KiB
47Accepted68ms8916 KiB
48Accepted72ms8916 KiB
49Accepted71ms8896 KiB
50Accepted67ms8916 KiB
51Accepted70ms8820 KiB
52Accepted68ms8912 KiB