Mai intai trebuie sa te autentifici.

Cod sursa(job #1009158)

Utilizator raddudjPogonariu Radu raddudj Data 12 octombrie 2013 15:58:20
Problema Subsir crescator maximal Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <cstdio>
#include <climits>
using namespace std;
int a[100010],t[100010][2],rez[100010];
int main()
{
    int n,k,i,j,max=INT_MIN;
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    scanf("%d",&n);
    for(i=1; i<=n; i++)
    {
        scanf("%d",&a[i]);
        t[i][0]=1;
        t[i][1]=i;
        for(j=1; j<=i-1; j++)
            if(a[j]<a[i]&&t[j][0]+1>t[i][0])
                {
                    t[i][0]=t[j][0]+1;
                    t[i][1]=j;
                }
        if(t[max][0]<=t[i][0])
            max=i;
    }
    printf("%d\n",t[max][0]);
    i=0;
    rez[++i]=a[max];
    k=t[max][1];
    while(t[k][0]!=1)
    {
        rez[++i]=a[k];
        k=t[k][1];
    }
    rez[++i]=a[k];
    for(;i>=1;i--)
        printf("%d ",rez[i]);
    return 0;
}