140552025-01-09 18:00:03vma44Inverziócpp17Wrong answer 9/50182ms2600 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector <int> v(n+1);

    for (int i = 0; i < n; i++)
        {
            int x;
            cin >> x;
            v[x] = i+1;
        }

    int m = 0;
    int sz1;
    int k = 0;
    int sz2;
    int sz2_h;

    for (int i = 0; i < n+1; i++)
        {
            if (v[i] > m)
            {
                m = v[i];
                sz1 = i;
            }
            else
                {
                    if(m - v[i] > k)
                        {
                            k = m - v[i];
                            sz2 = i;
                            sz2_h = v[i];
                        }
                }

        }
    if (k != 0)
        cout << sz2_h << " " << m << "\n";
    else
        cout << "-1\n";
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base9/50
1Accepted0/01ms316 KiB
2Wrong answer0/017ms568 KiB
3Accepted1/11ms500 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/71ms316 KiB
6Accepted2/217ms564 KiB
7Wrong answer0/2177ms2368 KiB
8Wrong answer0/2180ms2364 KiB
9Accepted2/2180ms2372 KiB
10Wrong answer0/2182ms2228 KiB
11Wrong answer0/2179ms2356 KiB
12Wrong answer0/2173ms2100 KiB
13Wrong answer0/2180ms2364 KiB
14Wrong answer0/2177ms2356 KiB
15Wrong answer0/2175ms2548 KiB
16Wrong answer0/2179ms2600 KiB
17Wrong answer0/2178ms2356 KiB
18Wrong answer0/2175ms2356 KiB
19Wrong answer0/3173ms2296 KiB
20Wrong answer0/3174ms2364 KiB
21Wrong answer0/2173ms2356 KiB
22Wrong answer0/2178ms2236 KiB
23Wrong answer0/2179ms2356 KiB
24Accepted2/2173ms2364 KiB