149632025-02-10 10:36:02markfsibianInverziócpp17Wrong answer 47/50486ms23880 KiB
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;



int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	multimap<int, int> v;
	int n, t;
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> t;
		v.insert({ t, i });
	}
	int maxi = 0, res = -1, ind = -1;
	for (auto& e : v)
	{
		if (e.second > maxi)
			maxi = e.second;
		if (maxi - e.second > res)
		{
			res = maxi - e.second;
			ind = maxi;
		}
	}
	if (res == -1)
	{
		cout << -1;
		return 0;
	}
	cout << ind - res << " " << ind;
}

SubtaskSumTestVerdictTimeMemory
base47/50
1Accepted0/01ms508 KiB
2Accepted0/018ms2628 KiB
3Wrong answer0/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/220ms2612 KiB
7Accepted2/2209ms23668 KiB
8Accepted2/2411ms23764 KiB
9Accepted2/2486ms23692 KiB
10Accepted2/2386ms23880 KiB
11Accepted2/2386ms23860 KiB
12Accepted2/2342ms23352 KiB
13Accepted2/2421ms23860 KiB
14Accepted2/2414ms23856 KiB
15Accepted2/2192ms23856 KiB
16Accepted2/2331ms23860 KiB
17Accepted2/2391ms23860 KiB
18Accepted2/2388ms23860 KiB
19Accepted3/3194ms23752 KiB
20Accepted3/3194ms23860 KiB
21Accepted2/2194ms23736 KiB
22Accepted2/2386ms23820 KiB
23Accepted2/2409ms23740 KiB
24Wrong answer0/2248ms23860 KiB