Cod sursa(job #693314)
Utilizator | Popescu Andreea pandreeae | Data | 27 februarie 2012 11:43:49 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<stdio.h>
using namespace std;
int main ()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int n,a[100002],best[100002],i,j,max;
scanf("%d%d",&n,&a[0]);
best[0]=1;
for(i=1;i<n;i++){
scanf("%d",&a[i]);
max=1;
for(j=0;j<i;j++){
if(a[i]>a[j]&best[max]<best[j])
max=j;}
best[i]=best[max]+1;}
max=0;
for(i=1;i<n;i++)
if(best[i]>max)
max=best[i];
printf("%d",max);
return 0;
}