Cod sursa(job #942886)
| Utilizator | Data | 23 aprilie 2013 19:21:38 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<cstdio>
#define nx 100001
long int v[nx];
int n,m,i,j,max,w[nx],l[nx];
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%ld",&v[i]);
w[n]=-1;
l[n]=1;
for(i=n-1;i>=1;i--){
l[i]=1;
w[i]=-1;
for(j=i+1;j<=n;j++)
if(v[i]<v[j] && l[i]<1+l[j]){
l[i]=1+l[j];
w[i]=j;
}
}
for(i=1;i<=n;i++)if(l[i]>max)max=l[i],m=i;
printf("%d\n",max);
for(i=m;i!=-1;i=w[i])printf("%ld ",v[i]);
return 0;
}
