Cod sursa(job #445945)
Utilizator | Data | 24 aprilie 2010 15:49:37 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int n,a[100005],i,j,max=0;
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&a[i]);
lung[1]=1;
for(i=2;i<=n;++i)
{
max=0;
for(j=1;j<i;++j)
{
if(a[j]>a[i]) continue;
if(lung[j]>max) max=lung[j];
}
lung[i]=max+1;
}
printf("%d",max);
return 0;
}