Cod sursa(job #1887514)

Utilizator MolnarMalinaMalina MolnarMalina Data 21 februarie 2017 17:20:27
Problema Subsir crescator maximal Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.37 kb
#include <fstream>
using namespace std;
ifstream fi("scmax.in");
ofstream fo("scmax.out");

/*solutie de 30 de puncte
int main()
{
    int v[100005], l[100005];
    int i,k,maxim,n,t;
    fi>>n;
    for(i=1; i<=n; i++)
        fi>>v[i];
    l[n]=0;
    for(k=n; k>=1; k--)
    {
        maxim=0;
        for(i=k+1; i<=n; i++)
        {
            if(v[i]>v[k] && l[i]>maxim)
                maxim=l[i];
            l[k]=1+maxim;
        }
    }
    maxim=0;
    for(i=1; i<=n; i++)
        if(l[i]>maxim)
    {
        maxim=l[i];
        t=i;
    }
    fo<<maxim<<"\n";
    fo<<v[t]<<" ";
    for(i=t+1; i<=n; i++)
        if(v[i]>v[t] && l[i]==maxim-1)
    {
        fo<<v[i]<<" ";
        maxim--;
    }
    */

    int main()
    {
        int n,l[100005], poz[100005], a[100005],m=0,i,j,prim;
        fi>>n;
        for(i=1; i<=n; i++)
            fi>>a[i];
        for(i=n; i>=1; i--)
        {
            l[i]=1;
            poz[i]=0;
            for(j=i+1; j<=n; j++)
                if(a[i]<a[j] && l[i]<1+l[j])
                    {
                        l[i]=1+l[j]; poz[i]=j;
                    }
            if(m<l[i])
            {
                m=l[i];
                prim=i;
            }
        }
        for(i=prim; i>0; i=poz[i])
            fo<<a[i]<<" ";
        fi.close();
        fo.close();
    }