Cod sursa(job #1148228)
| Utilizator | Data | 20 martie 2014 16:45:13 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<stdio.h>
int v[100001],L[100001];
int main(){
int n,i,m,max,j;
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
m=0;
L[n]=1;
for(i=n-1;i>=1;i--){
max=0;
for(j=i+1;j<=n;j++)
if(v[i]<v[j]&&max<L[j])
max=L[j];
L[i]=max+1;
if(m<max+1)
m=max+1;
}
printf("%d\n",m);
for(i=1;i<=n&&m!=0;i++)
if(L[i]==m){
printf("%d ",v[i]);
m--;
}
printf("\n");
return 0;
}
