196112025-12-17 09:35:47VietnameseButcherInverziócpp17Time limit exceeded 10/50600ms2548 KiB

#include <iostream>
#include <vector>
#include <climits>

using namespace std;

int n,turo1,turo2,maxi=INT_MIN,i,j;

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; ++i)
	{
		for (int j = i+1; j <= n; ++j)
		{
			if (i<j && v[j]<v[i] && maxi < j - i)
			{
				maxi = j - i;
				turo1 = i;
				turo2 = j;

			}
			
		}
	}
	if (maxi == INT_MIN)
		cout << -1;
	else
	cout << turo1 << " " << turo2;
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0582ms756 KiB
3Accepted1/11ms316 KiB
4Accepted2/24ms316 KiB
5Accepted7/72ms316 KiB
6Time limit exceeded0/2600ms564 KiB
7Time limit exceeded0/2600ms2356 KiB
8Time limit exceeded0/2587ms2356 KiB
9Time limit exceeded0/2583ms2356 KiB
10Time limit exceeded0/2580ms2356 KiB
11Time limit exceeded0/2583ms2356 KiB
12Time limit exceeded0/2600ms2100 KiB
13Time limit exceeded0/2586ms2356 KiB
14Time limit exceeded0/2598ms2356 KiB
15Time limit exceeded0/2600ms2356 KiB
16Time limit exceeded0/2580ms2548 KiB
17Time limit exceeded0/2593ms2356 KiB
18Time limit exceeded0/2584ms2356 KiB
19Time limit exceeded0/3586ms2356 KiB
20Time limit exceeded0/3600ms2356 KiB
21Time limit exceeded0/2584ms2356 KiB
22Time limit exceeded0/2600ms2356 KiB
23Time limit exceeded0/2598ms2356 KiB
24Time limit exceeded0/2583ms2356 KiB