Submission #13,387

2025-01-07 18:36:48

cpp17

Accepted 50/50

190ms

2364 KiB

#include <iostream>
using namespace std;
int a[500001]={};
int main()
{
    int n,x; cin>>n;
    for(int i=1;i<=n;i++){cin>>x; a[x]=i;}
    int tav=0,kez,veg,maxi=1;
    for(int i=2; i<=n; i++){
        if(a[i]<a[maxi]){
            if(a[maxi]-a[i]>tav){
                tav=a[maxi]-a[i]; veg=maxi; kez=i;}}
            else maxi=i;}
    if(tav>0)cout<<a[kez]<<" "<<a[veg]<<endl;
    else cout<<-1;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	532 KiB
		2	Accepted	0/0	17ms	544 KiB
		3	Accepted	1/1	1ms	500 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	7/7	1ms	316 KiB
		6	Accepted	2/2	17ms	484 KiB
		7	Accepted	2/2	180ms	2100 KiB
		8	Accepted	2/2	185ms	2336 KiB
		9	Accepted	2/2	190ms	2352 KiB
		10	Accepted	2/2	181ms	2228 KiB
		11	Accepted	2/2	181ms	2356 KiB
		12	Accepted	2/2	180ms	2100 KiB
		13	Accepted	2/2	181ms	2100 KiB
		14	Accepted	2/2	182ms	2160 KiB
		15	Accepted	2/2	180ms	2104 KiB
		16	Accepted	2/2	184ms	2360 KiB
		17	Accepted	2/2	182ms	2152 KiB
		18	Accepted	2/2	181ms	2156 KiB
		19	Accepted	3/3	180ms	2340 KiB
		20	Accepted	3/3	180ms	2244 KiB
		21	Accepted	2/2	180ms	2104 KiB
		22	Accepted	2/2	181ms	2364 KiB
		23	Accepted	2/2	184ms	2324 KiB
		24	Accepted	2/2	180ms	2356 KiB