140432025-01-09 17:54:37zhuyiInverziócpp17Accepted 50/50196ms2540 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main()
{
    int n; cin >> n;
    vector <int> S(n+1);
    for(int i = 1; i <= n; i++)
    {
        int s; cin >> s;
        S[s] = i;
    }
    int maxi = 0;
    int ans1 = 0; int ans2 = 0;
    int cur = S[1];
    for(int i = 2; i <= n; i++)
    {
        if(S[i] > cur) cur = S[i];
        else if(cur - S[i] > maxi){
            {
                maxi = cur - S[i];

                ans1 = cur;
                ans2 = S[i];

            }
        }
    }
    if(maxi == 0){
        cout << -1;
        return 0;
    }
    cout << ans2 << " " << ans1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/017ms756 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms500 KiB
5Accepted7/71ms500 KiB
6Accepted2/217ms564 KiB
7Accepted2/2181ms2356 KiB
8Accepted2/2196ms2340 KiB
9Accepted2/2188ms2368 KiB
10Accepted2/2185ms2360 KiB
11Accepted2/2186ms2356 KiB
12Accepted2/2180ms2328 KiB
13Accepted2/2185ms2364 KiB
14Accepted2/2184ms2364 KiB
15Accepted2/2181ms2356 KiB
16Accepted2/2185ms2356 KiB
17Accepted2/2186ms2360 KiB
18Accepted2/2185ms2356 KiB
19Accepted3/3180ms2364 KiB
20Accepted3/3181ms2360 KiB
21Accepted2/2181ms2372 KiB
22Accepted2/2185ms2540 KiB
23Accepted2/2185ms2356 KiB
24Accepted2/2181ms2356 KiB