Cod sursa(job #1051370)

Utilizator denis_tdrdenis tdr denis_tdr Data 9 decembrie 2013 22:55:25
Problema Subsir crescator maximal Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <iostream>
#include <fstream>
//#include <vector>
using namespace std;
//vector<int> a, best, poz;
int n, maxim, sol=0, p;
int a[100003], best[100003], poz[100003];
int main()
{
    ifstream fin("scmx.in");
    fin>>n;
    //a=vector<int>(n+100, -1);
    for(int i=1; i<=n; i++)
        fin>>a[i];
    fin.close();

    //best=vector<int>(n+2, -1);
    //poz=vector<int>(n+2,-1);
    best[n]=1;
    poz[n]=-1;
    maxim=1, p=n;
    for(int i=n-1; i>=1; i--)
    {
        best[i]=1; poz[i]=-1;
        for(int j=i+1; j<=n;j++)
            if(a[i]<a[j] && best[i]<best[j]+1)
            {
                best[i]=best[j]+1; poz[i]=j;
                if(best[i]>maxim) maxim=best[i], p=i;
            }
    }
    ofstream fout("scmx.out");
    fout<<maxim<<"\n";
    int i=p;
    while(i!=-1)
        fout<<a[i]<<" ", i=poz[i];
    fout<<"\n";
    fout.close();
    return 0;
}