127032024-12-28 21:45:08nkbalintInverziócpp17Time limit exceeded 9/50600ms2356 KiB
#include <iostream>

using namespace std;

int n, i, v[500001], j,maxi,poz1,poz2;

int main()
{
    cin >> n;
    for (i = 1;i <= n;++i) cin >> v[i];
    for (i = 1;i <= n;++i)
    {
        for (j = i + 1;j <= n;++j)
        {
            if (v[i] > v[j] && j - i > maxi)
            {
                maxi = j - i;
                poz1 = i;
                poz2 = j;
            }
        }
    }
    cout << poz1 << " " << poz2;

}
SubtaskSumTestVerdictTimeMemory
base9/50
1Accepted0/01ms320 KiB
2Time limit exceeded0/0578ms568 KiB
3Wrong answer0/11ms320 KiB
4Accepted2/24ms500 KiB
5Accepted7/72ms320 KiB
6Time limit exceeded0/2600ms568 KiB
7Time limit exceeded0/2600ms2148 KiB
8Time limit exceeded0/2600ms2304 KiB
9Time limit exceeded0/2587ms2224 KiB
10Time limit exceeded0/2600ms2104 KiB
11Time limit exceeded0/2600ms2236 KiB
12Time limit exceeded0/2600ms2068 KiB
13Time limit exceeded0/2578ms2104 KiB
14Time limit exceeded0/2600ms2344 KiB
15Time limit exceeded0/2600ms2268 KiB
16Time limit exceeded0/2600ms2164 KiB
17Time limit exceeded0/2584ms2316 KiB
18Time limit exceeded0/2600ms2104 KiB
19Time limit exceeded0/3600ms2116 KiB
20Time limit exceeded0/3600ms2164 KiB
21Time limit exceeded0/2583ms2104 KiB
22Time limit exceeded0/2600ms2104 KiB
23Time limit exceeded0/2600ms2356 KiB
24Time limit exceeded0/2600ms2256 KiB