140322025-01-09 17:44:49miszorimarciInverziócpp17Wrong answer 47/50184ms2548 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, 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]);
    }
    cout << c << " " << b;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base47/50
1Accepted0/01ms316 KiB
2Accepted0/017ms748 KiB
3Wrong answer0/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms564 KiB
7Accepted2/2177ms2368 KiB
8Accepted2/2184ms2356 KiB
9Accepted2/2180ms2364 KiB
10Accepted2/2180ms2356 KiB
11Accepted2/2181ms2356 KiB
12Accepted2/2175ms2328 KiB
13Accepted2/2177ms2356 KiB
14Accepted2/2179ms2356 KiB
15Accepted2/2177ms2356 KiB
16Accepted2/2180ms2356 KiB
17Accepted2/2179ms2356 KiB
18Accepted2/2184ms2356 KiB
19Accepted3/3177ms2356 KiB
20Accepted3/3177ms2204 KiB
21Accepted2/2175ms2368 KiB
22Accepted2/2177ms2372 KiB
23Accepted2/2181ms2548 KiB
24Wrong answer0/2174ms2356 KiB