Submission #14,863

2025-02-05 09:26:45

cpp17

Wrong answer 34/35

75ms

5068 KiB

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

using namespace std;

multimap<int, int> v;

int main()
{
    int n;
    cin >> n;
    int t;
    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;
    else
        cout << ind - res << " " << ind;
}

	Sum	Test	Verdict		Time	Memory
base	34/35
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	75ms	4916 KiB
		3	Wrong answer	0/1	1ms	316 KiB
		4	Accepted	1/1	1ms	316 KiB
		5	Accepted	1/1	1ms	316 KiB
		6	Accepted	1/1	1ms	316 KiB
		7	Accepted	1/1	1ms	404 KiB
		8	Accepted	1/1	1ms	316 KiB
		9	Accepted	1/1	2ms	508 KiB
		10	Accepted	1/1	3ms	316 KiB
		11	Accepted	1/1	3ms	564 KiB
		12	Accepted	2/2	23ms	2212 KiB
		13	Accepted	2/2	27ms	2308 KiB
		14	Accepted	2/2	29ms	2484 KiB
		15	Accepted	2/2	17ms	1748 KiB
		16	Accepted	2/2	30ms	2616 KiB
		17	Accepted	2/2	50ms	3656 KiB
		18	Accepted	2/2	54ms	4148 KiB
		19	Accepted	2/2	64ms	4388 KiB
		20	Accepted	2/2	61ms	4404 KiB
		21	Accepted	2/2	72ms	4852 KiB
		22	Accepted	2/2	70ms	5068 KiB
		23	Accepted	2/2	67ms	5008 KiB
		24	Accepted	2/2	65ms	4916 KiB