140352025-01-09 17:46:43miszorimarciInverziócpp17Accepted 50/50184ms2568 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n; cin >> n;
    vector<int>a(n+1);
    for(int i = 1; i <= n; i++)
    {
        int x; cin >> x;
        a[x] = i;
    }
    int maxi = 0;
    int index = 0;
    int maxinverzio = 0;
    int c = -1, b;
    for(int i = 1; i <= n; i++)
    {
       if(i > 1)
       {
          if(maxi - a[i] > maxinverzio)
          {
              maxinverzio = maxi - a[i];
              c = a[i], b = maxi;
          }
       }
       maxi = max(maxi, a[i]);
    }
    if(c == -1)
    {
        cout << -1;
        return 0;
    }
    cout << c << " " << b;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/017ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms508 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms564 KiB
7Accepted2/2175ms2356 KiB
8Accepted2/2181ms2368 KiB
9Accepted2/2184ms2368 KiB
10Accepted2/2179ms2364 KiB
11Accepted2/2181ms2360 KiB
12Accepted2/2179ms2100 KiB
13Accepted2/2181ms2368 KiB
14Accepted2/2181ms2364 KiB
15Accepted2/2175ms2356 KiB
16Accepted2/2180ms2372 KiB
17Accepted2/2180ms2372 KiB
18Accepted2/2179ms2356 KiB
19Accepted3/3175ms2356 KiB
20Accepted3/3175ms2372 KiB
21Accepted2/2177ms2356 KiB
22Accepted2/2180ms2364 KiB
23Accepted2/2181ms2568 KiB
24Accepted2/2174ms2356 KiB