Cod sursa(job #455824)
| Utilizator | Data | 14 mai 2010 11:49:24 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.86 kb |
#include<iostream.h>
long n, v[10000];
main()
{
long last[10000],a[10000],i,j;
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
scanf("%ld", &n);
for( i=1; i<=n; i++)
{
scanf("%ld", &v[i]);
a[i]=1;
}
for( i=1; i<=n; i++)
for( j=i+1; j<=n; j++)
{
if((v[i] < v[j])&&(a[i]+1!= a[j])) {a[j]++;
}
}
long m=0;
for( i=1; i<=n; i++)
if(a[i]>m) m=a[i];
printf("%ld", m);
return 0;
}
