151852025-02-15 14:03:30iSamu7598Legmesszebbi rossz sorrendű (35 pont)cpp17Wrong answer 0/3510ms5888 KiB
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n, x1, x2, tav, v[100005];
vector<vector<int> > lista(100005, vector<int> (3, 0));


void beteves(int akt, int sorszam, int akttav, int hova){
if(akt<lista[hova][0]){
    if(akttav==0){

        akttav=sorszam-hova;

        if(tav<akttav){
                tav=akttav;
            x1=hova;
            x2=sorszam;
        }
    }
    if(lista[hova][1]==0){
        lista[hova][1]=sorszam;
    }
    else{
        beteves(akt, sorszam, akttav, lista[hova][1]);
    }
}
else{
    if(lista[hova][2]==0){
        lista[hova][2]=sorszam;
    }
    else{
        beteves(akt, sorszam, akttav, lista[hova][2]);
    }
}
}

int main()
{





    ifstream fin("be.txt");  cin.rdbuf(fin.rdbuf());

cin>>n;
int s;
cin>>s;
lista[1][0]=s;

for(int i=2; i<=n; i++){
    cin>>s;
    lista[i][0]=s;
    beteves(s, i, 0, 1);
}
cout<<x1<<" "<<x2;

/*for(int i=1; i<=n; i++){
    cin>>v[i];
}

for(int i=1; i<=n-tav; i++){
    for(int j=n; j>i; j--){
        if(v[j]<v[i]&&j-i>tav){
            tav=j-i;
            x1=i;
            x2=j;
            break;
        }
    }
}
cout<<x1<<" "<<x2;*/
    return 0;
}


SubtaskSumTestVerdictTimeMemory
base0/35
1Wrong answer0/010ms5684 KiB
2Wrong answer0/09ms5868 KiB
3Wrong answer0/110ms5684 KiB
4Wrong answer0/19ms5684 KiB
5Wrong answer0/110ms5876 KiB
6Wrong answer0/19ms5684 KiB
7Wrong answer0/19ms5684 KiB
8Wrong answer0/110ms5684 KiB
9Wrong answer0/19ms5684 KiB
10Wrong answer0/110ms5848 KiB
11Wrong answer0/110ms5716 KiB
12Wrong answer0/29ms5652 KiB
13Wrong answer0/29ms5684 KiB
14Wrong answer0/29ms5684 KiB
15Wrong answer0/29ms5684 KiB
16Wrong answer0/210ms5696 KiB
17Wrong answer0/210ms5684 KiB
18Wrong answer0/29ms5652 KiB
19Wrong answer0/29ms5648 KiB
20Wrong answer0/210ms5672 KiB
21Wrong answer0/210ms5876 KiB
22Wrong answer0/29ms5888 KiB
23Wrong answer0/29ms5684 KiB
24Wrong answer0/210ms5724 KiB