148282025-02-04 11:06:18ercseferencLegmesszebbi rossz sorrendű (35 pont)cpp17Wrong answer 6/3534ms792 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;
}
SubtaskSumTestVerdictTimeMemory
base6/35
1Wrong answer0/01ms316 KiB
2Runtime error0/01ms412 KiB
3Accepted1/11ms508 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms508 KiB
7Runtime error0/11ms404 KiB
8Runtime error0/11ms316 KiB
9Runtime error0/11ms316 KiB
10Runtime error0/11ms316 KiB
11Runtime error0/11ms316 KiB
12Runtime error0/21ms316 KiB
13Runtime error0/21ms316 KiB
14Runtime error0/21ms316 KiB
15Runtime error0/21ms316 KiB
16Runtime error0/21ms316 KiB
17Runtime error0/21ms316 KiB
18Runtime error0/22ms316 KiB
19Runtime error0/21ms316 KiB
20Runtime error0/21ms316 KiB
21Runtime error0/21ms316 KiB
22Runtime error0/21ms412 KiB
23Wrong answer0/234ms772 KiB
24Accepted2/234ms792 KiB