Submission #24,797

2026-02-15 13:36:19

cpp17

Accepted 35/35

45ms

1688 KiB

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
    vector<int>v(n), pr(n);
    for(int &i : v)cin >> i;
    pr[0] = v[0];
    for(int i = 1; i < n; i++)pr[i] = max(pr[i-1], v[i]);
    int mx = -1, l, r;
    for(int i = 1; i < n; i++)
    {
        int x = upper_bound(pr.begin(), pr.end(), v[i])-pr.begin();
        if(i-x > mx)
        {
            mx=i-x;
            r = i+1, l = x+1;
        }
    }
    if(mx == -1)cout << -1;
    else cout << l << " " << r;
    


}

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	43ms	1588 KiB
		3	Accepted	1/1	1ms	500 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	316 KiB
		8	Accepted	1/1	1ms	392 KiB
		9	Accepted	1/1	2ms	316 KiB
		10	Accepted	1/1	2ms	444 KiB
		11	Accepted	1/1	3ms	332 KiB
		12	Accepted	2/2	17ms	748 KiB
		13	Accepted	2/2	18ms	564 KiB
		14	Accepted	2/2	20ms	788 KiB
		15	Accepted	2/2	13ms	644 KiB
		16	Accepted	2/2	21ms	1156 KiB
		17	Accepted	2/2	30ms	964 KiB
		18	Accepted	2/2	35ms	1076 KiB
		19	Accepted	2/2	39ms	1588 KiB
		20	Accepted	2/2	41ms	1588 KiB
		21	Accepted	2/2	43ms	1076 KiB
		22	Accepted	2/2	45ms	1688 KiB
		23	Accepted	2/2	39ms	1192 KiB
		24	Accepted	2/2	39ms	1076 KiB