196072025-12-17 09:21:38tenyeszbikaInverziócpp17Time limit exceeded 10/50600ms5548 KiB
#include <iostream>
#include <vector>
#include <climits>

using namespace std;

int n,p1,p2,maxi=INT_MIN;

vector<int> v;

int main()
{
	cin >> n;
	v.resize(n + 1);
		for (int i = 1; i <= n; ++i)
		{
			cin >> v[i];
		}
		for (int i=1; i <= n - 1; ++i)
		{
			for (int j = i; j <= n; ++j)
			{
				if(v[i]>v[j])
				{
					if (maxi < (j - i))
					{
						maxi = j - i;
						p1 = i;
						p2 = j;
					}
				}
			}
		}
		if (maxi == INT_MIN)
			cout << -1;
		else 
			cout << p1 << " " << p2;
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0583ms820 KiB
3Accepted1/11ms316 KiB
4Accepted2/23ms316 KiB
5Accepted7/72ms316 KiB
6Time limit exceeded0/2600ms652 KiB
7Time limit exceeded0/2600ms2360 KiB
8Time limit exceeded0/2598ms5420 KiB
9Time limit exceeded0/2583ms2356 KiB
10Time limit exceeded0/2589ms2356 KiB
11Time limit exceeded0/2592ms2356 KiB
12Time limit exceeded0/2600ms5384 KiB
13Time limit exceeded0/2588ms2356 KiB
14Time limit exceeded0/2580ms2356 KiB
15Time limit exceeded0/2583ms2372 KiB
16Time limit exceeded0/2600ms5428 KiB
17Time limit exceeded0/2580ms2356 KiB
18Time limit exceeded0/2589ms2356 KiB
19Time limit exceeded0/3592ms5428 KiB
20Time limit exceeded0/3600ms2356 KiB
21Time limit exceeded0/2582ms2356 KiB
22Time limit exceeded0/2573ms5548 KiB
23Time limit exceeded0/2569ms2636 KiB
24Time limit exceeded0/2600ms2356 KiB