254762026-02-20 11:41:32SzeredaiNatanaelSíkság (55)cpp17Wrong answer 0/5535ms1592 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;
		}
	}

	cout << p2 << " " << p;
}
SubtaskSumTestVerdictTimeMemory
base0/55
1Wrong answer0/01ms316 KiB
2Wrong answer0/04ms508 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/31ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/31ms412 KiB
10Wrong answer0/34ms316 KiB
11Wrong answer0/33ms316 KiB
12Wrong answer0/34ms316 KiB
13Wrong answer0/332ms1592 KiB
14Wrong answer0/319ms1340 KiB
15Wrong answer0/327ms1580 KiB
16Wrong answer0/334ms1588 KiB
17Wrong answer0/335ms1584 KiB
18Wrong answer0/334ms1588 KiB
19Wrong answer0/334ms1572 KiB
20Wrong answer0/334ms1332 KiB
21Wrong answer0/317ms1016 KiB
22Wrong answer0/327ms1320 KiB