241362026-02-04 18:12:42Pedri26Legmesszebbi rossz sorrendű (35 pont)cpp17Wrong answer 0/3539ms2688 KiB
#include <bits/stdc++.h>

using namespace std;
int n;

struct bencu
{
    int szam;
    int poz;
} a[100001];

bool valami(const bencu x, const bencu y)
{
    return (x.szam<y.szam);
}

int main() {
	
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].szam;
        a[i].poz=i;
    }

    sort(a+1, a+n+1, valami);
    for(int i=1;i<=n;i++)
    {
        cout<<a[i].szam<<" ";
    }
    cout<<endl;
    for(int i=1;i<=n;i++)
    {
        cout<<a[i].poz<<" ";
    }
    cout<<endl;
    int lns=-1, poz1=-1, poz2=-1;
    int maxind=0, maxindpoz=0;
    a[0].szam=INT_MIN;
    for(int i=1;i<=n;i++)
    {
        if(a[i].poz<maxind && a[i].szam>a[maxindpoz].szam)
        {
            //cout<<maxind-a[i].poz<<endl;
            if(maxind-a[i].poz>lns)
            {
                lns=maxind-a[i].poz;
                poz1=a[i].poz;
                poz2=maxind;
            }
        }
        if(a[i].poz>maxind)
        {
            maxind=a[i].poz;
            maxindpoz=i;
        }
    }
    if(lns>0)cout<<poz1<<" "<<poz2;
    else cout<<"-1";

    
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/35
1Wrong answer0/01ms316 KiB
2Wrong answer0/039ms2356 KiB
3Wrong answer0/11ms316 KiB
4Wrong answer0/11ms316 KiB
5Wrong answer0/11ms316 KiB
6Wrong answer0/11ms512 KiB
7Wrong answer0/11ms316 KiB
8Wrong answer0/11ms508 KiB
9Wrong answer0/12ms316 KiB
10Wrong answer0/12ms316 KiB
11Wrong answer0/12ms332 KiB
12Wrong answer0/214ms1076 KiB
13Wrong answer0/217ms1332 KiB
14Wrong answer0/217ms1268 KiB
15Wrong answer0/210ms820 KiB
16Wrong answer0/218ms1408 KiB
17Wrong answer0/228ms1804 KiB
18Wrong answer0/232ms1972 KiB
19Wrong answer0/235ms2656 KiB
20Wrong answer0/237ms2688 KiB
21Wrong answer0/239ms2356 KiB
22Wrong answer0/239ms2336 KiB
23Wrong answer0/232ms2376 KiB
24Wrong answer0/234ms2292 KiB