145542025-01-15 17:42:54badamInverziócpp17Time limit exceeded 10/50600ms4244 KiB
#include <iostream>

using namespace std;
struct szam
{
    int sorszam, ertek;
};

int main()
{

    int n;
    cin >> n;
    szam t[n];
    int b=n-1;
    for(int i=0;i<n;i++)
    {
        cin >> t[i].ertek;
        t[i].sorszam=i;
    }
    if(n==1)
    {
        cout << -1;
    }
    else
    {


    while(b>0)
    {


    for(int i=0;i<n-1;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(t[j].ertek<t[i].ertek and t[j].sorszam-t[i].sorszam==b)
            {
                cout << i+1 << " " << j+1;
                return 0;
            }

        }

    }
    b--;
    }
    cout << -1;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0577ms712 KiB
3Accepted1/11ms316 KiB
4Accepted2/22ms316 KiB
5Accepted7/7165ms316 KiB
6Time limit exceeded0/2600ms760 KiB
7Time limit exceeded0/2600ms4092 KiB
8Time limit exceeded0/2575ms4148 KiB
9Time limit exceeded0/2580ms4244 KiB
10Time limit exceeded0/2583ms4084 KiB
11Time limit exceeded0/2583ms4216 KiB
12Time limit exceeded0/2587ms4148 KiB
13Time limit exceeded0/2574ms4200 KiB
14Time limit exceeded0/2600ms4156 KiB
15Time limit exceeded0/2600ms4124 KiB
16Time limit exceeded0/2592ms4152 KiB
17Time limit exceeded0/2586ms4148 KiB
18Time limit exceeded0/2586ms4152 KiB
19Time limit exceeded0/3586ms4148 KiB
20Time limit exceeded0/3578ms4160 KiB
21Time limit exceeded0/2580ms4148 KiB
22Time limit exceeded0/2600ms4092 KiB
23Time limit exceeded0/2600ms4148 KiB
24Time limit exceeded0/2592ms4148 KiB