254822026-02-20 11:50:51SzeredaiNatanaelLegmesszebbi rossz sorrendű (35 pont)cpp17Wrong answer 30/3539ms1588 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
	int n, mini = 100001, maxi = -100001;
	cin >> n;
	vector<int> v(n + 1);
	vector<int> ma(n + 1);
	vector<int> mi(n + 1);
	
	for (int i = 1; i <= n; ++i) {
		cin >> v[i];

		if (v[i] > maxi) {
			maxi = v[i];
		}
		ma[i] = maxi;
	}
	for (int j = n; j > 0; --j) {
		if (v[j] < mini) {
			mini = v[j];
		}
		mi[j] = mini;
	}

	int i = 1, j = 1, p = -1, p2 = -1, t, maxit = 0;
	while (j <= n && i <= n) {
		if (ma[i] > mi[j]) {
			++j;
		}
		else {
			t = j - 1 - i;
			if (t > maxit) {
				maxit = t;
				p = j - 1;
				p2 = i;
			}
			++i;
		}
	}

	if (p == -1) {
		cout << "-1";
	}
	else {
		cout << p2 << " " << p;
	}
}
SubtaskSumTestVerdictTimeMemory
base30/35
1Accepted0/01ms316 KiB
2Accepted0/039ms1416 KiB
3Accepted1/11ms316 KiB
4Wrong answer0/11ms508 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms560 KiB
8Accepted1/11ms316 KiB
9Accepted1/12ms424 KiB
10Accepted1/12ms316 KiB
11Accepted1/12ms316 KiB
12Accepted2/216ms896 KiB
13Accepted2/217ms936 KiB
14Accepted2/218ms984 KiB
15Accepted2/212ms756 KiB
16Accepted2/219ms820 KiB
17Accepted2/227ms1240 KiB
18Accepted2/230ms1360 KiB
19Accepted2/234ms1444 KiB
20Accepted2/235ms1332 KiB
21Accepted2/237ms1576 KiB
22Accepted2/237ms1588 KiB
23Wrong answer0/235ms1576 KiB
24Wrong answer0/235ms1332 KiB