Submission #14,919

2025-02-07 11:23:35

cpp17

Wrong answer 31/50

577ms

24116 KiB

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;



int main()
{
	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;
}

	Sum	Test	Verdict		Time	Memory
base	31/50
		1	Accepted	0/0	1ms	508 KiB
		2	Accepted	0/0	28ms	2612 KiB
		3	Wrong answer	0/1	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	7/7	2ms	316 KiB
		6	Accepted	2/2	32ms	2636 KiB
		7	Accepted	2/2	316ms	23860 KiB
		8	Time limit exceeded	0/2	577ms	23860 KiB
		9	Time limit exceeded	0/2	546ms	23792 KiB
		10	Time limit exceeded	0/2	507ms	23860 KiB
		11	Accepted	2/2	446ms	23860 KiB
		12	Time limit exceeded	0/2	523ms	23208 KiB
		13	Accepted	2/2	449ms	23748 KiB
		14	Time limit exceeded	0/2	518ms	23860 KiB
		15	Accepted	2/2	310ms	23860 KiB
		16	Accepted	2/2	446ms	23860 KiB
		17	Time limit exceeded	0/2	514ms	23652 KiB
		18	Time limit exceeded	0/2	519ms	23868 KiB
		19	Accepted	3/3	310ms	23860 KiB
		20	Accepted	3/3	326ms	23736 KiB
		21	Accepted	2/2	310ms	23856 KiB
		22	Accepted	2/2	433ms	23880 KiB
		23	Time limit exceeded	0/2	504ms	24116 KiB
		24	Wrong answer	0/2	382ms	23860 KiB