149652025-02-10 10:54:15markfsibianInverziócpp17Wrong answer 47/50123ms4864 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);
	vector<pair<int, int>> v;
	int n, t;
	cin >> n;
	for (int i = 1; i <= n; ++i)
	{
		cin >> t;
		v.push_back({ t, i });
	}
	sort(v.begin(), v.end());
	int maxi = 0, res = -1, ind = -1, kezd = -1;
	for (auto& e : v)
	{
		if (e.second > maxi)
			maxi = e.second;
		if (maxi - e.second > res)
		{
			res = maxi - e.second;
			kezd = e.second;
			ind = maxi;
		}
	}
	if (res == -1)
	{
		cout << -1;
		return 0;
	}
	cout << kezd << " " << ind;
}

SubtaskSumTestVerdictTimeMemory
base47/50
1Accepted0/01ms316 KiB
2Accepted0/08ms952 KiB
3Wrong answer0/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/210ms976 KiB
7Accepted2/279ms4668 KiB
8Accepted2/2120ms4428 KiB
9Accepted2/2123ms4420 KiB
10Accepted2/2118ms4516 KiB
11Accepted2/2119ms4516 KiB
12Accepted2/2115ms4472 KiB
13Accepted2/2118ms4864 KiB
14Accepted2/2118ms4452 KiB
15Accepted2/279ms4516 KiB
16Accepted2/2118ms4516 KiB
17Accepted2/2118ms4516 KiB
18Accepted2/2119ms4520 KiB
19Accepted3/381ms4516 KiB
20Accepted3/379ms4580 KiB
21Accepted2/281ms4588 KiB
22Accepted2/2119ms4580 KiB
23Accepted2/2119ms4520 KiB
24Wrong answer0/274ms4516 KiB