186952025-10-30 23:57:4342Két ajándékpython3Accepted 100/10052ms8984 KiB
from sys import stdin
input=stdin.readline

def solv():
    N=int(input())
    E=list(map(int,input().split()))
    S=[0]*(N+1)
    for i in range(N-1,-1,-1):
        S[i]=max(E[i],S[i+1])
    cur=0
    #x=y=-1
    x=-1
    y=0
    for i in range(N-1):
        if E[i]<S[i+1] and E[i]+S[i+1]>cur:
            cur=E[i]+S[i+1]
            x=i
            y=S[i+1]
    for i in range(N-1,-1,-1):
        if E[i]==y:
            y=i+1
            break
    print(x+1,y)

solv()
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted17ms3124 KiB
2Accepted45ms7316 KiB
subtask210/10
3Accepted16ms3132 KiB
4Accepted17ms3124 KiB
5Accepted16ms3132 KiB
6Accepted16ms3124 KiB
7Accepted16ms3320 KiB
subtask310/10
8Accepted16ms2912 KiB
9Accepted16ms3316 KiB
10Accepted16ms3112 KiB
11Accepted16ms3140 KiB
12Accepted16ms2952 KiB
subtask420/20
13Accepted16ms3148 KiB
14Accepted16ms3052 KiB
15Accepted16ms3128 KiB
16Accepted16ms3124 KiB
17Accepted16ms3128 KiB
18Accepted16ms3196 KiB
19Accepted16ms3120 KiB
20Accepted16ms3276 KiB
21Accepted16ms3076 KiB
22Accepted16ms3124 KiB
subtask510/10
23Accepted18ms3380 KiB
24Accepted18ms3320 KiB
25Accepted19ms3540 KiB
26Accepted20ms3636 KiB
27Accepted21ms3896 KiB
subtask610/10
28Accepted23ms4196 KiB
29Accepted24ms4192 KiB
30Accepted24ms4372 KiB
31Accepted23ms4392 KiB
32Accepted23ms4196 KiB
subtask710/10
33Accepted35ms6452 KiB
34Accepted35ms6536 KiB
35Accepted37ms6372 KiB
36Accepted37ms6200 KiB
37Accepted37ms6648 KiB
subtask830/30
38Accepted43ms7824 KiB
39Accepted46ms7624 KiB
40Accepted45ms7876 KiB
41Accepted48ms8124 KiB
42Accepted48ms8184 KiB
43Accepted52ms8820 KiB
44Accepted52ms8944 KiB
45Accepted50ms8852 KiB
46Accepted52ms8852 KiB
47Accepted52ms8984 KiB
48Accepted50ms8800 KiB
49Accepted50ms8808 KiB
50Accepted52ms8964 KiB
51Accepted50ms8852 KiB
52Accepted52ms8852 KiB