240602026-02-03 18:44:35Pedri26Legmesszebbi rossz sorrendű (35 pont)cpp17Wrong answer 1/3525ms1648 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, poz2;
    for(int i=1;i<=n;i++)
    {
        int s=0, aktp1, aktp2;
        while(i<n && a[i].poz<a[i+1].poz)i++;
        s=a[i].poz;
        aktp1=a[i].poz;
        while(i<n && a[i].poz>a[i+1].poz)i++;
        aktp2=a[i].poz;
        s-=a[i].poz;
        if(s>lns && s!=0)
        {
            lns=s;
            poz1=aktp2;
            poz2=aktp1;
        }
    }
    if(lns>0)cout<<lns<<endl<<poz1<<" "<<poz2;
    else cout<<"-1";

    
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base1/35
1Wrong answer0/01ms316 KiB
2Wrong answer0/025ms1076 KiB
3Accepted1/11ms316 KiB
4Wrong answer0/11ms316 KiB
5Wrong answer0/11ms316 KiB
6Wrong answer0/11ms316 KiB
7Wrong answer0/11ms316 KiB
8Wrong answer0/11ms316 KiB
9Wrong answer0/11ms316 KiB
10Wrong answer0/11ms428 KiB
11Wrong answer0/12ms316 KiB
12Wrong answer0/28ms696 KiB
13Wrong answer0/29ms584 KiB
14Wrong answer0/29ms704 KiB
15Wrong answer0/26ms636 KiB
16Wrong answer0/210ms996 KiB
17Wrong answer0/217ms820 KiB
18Wrong answer0/219ms1056 KiB
19Wrong answer0/221ms1588 KiB
20Wrong answer0/223ms1648 KiB
21Wrong answer0/224ms1076 KiB
22Wrong answer0/225ms1204 KiB
23Wrong answer0/217ms1076 KiB
24Wrong answer0/217ms1088 KiB