Cod sursa(job #409655)
| Utilizator | Data | 3 martie 2010 19:43:17 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<stdio.h>
using namespace std;
int main()
{
int x,max,i,j,n,a[100001],l[100001];
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
l[n]=1; max=-int(2e9);
for(i=n-1;i>=1;i--)
{
l[i]=1;
for(j=n;j>=i+1;j--)
if((l[i]<l[j]+1)&&(a[j]>a[i])) l[i]=l[j]+1;
if(max<l[i]) max=l[i];
}
printf("%d\n",max);
x=0;
for(i=1;i<=n;i++)
if((x<a[i])&(l[i]==max)){ printf("%d ",a[i]); max--; x=a[i];}
return 0;
}