Cod sursa(job #797980)
Utilizator | Miu Alexandra alexamiu2008 | Data | 15 octombrie 2012 13:14:57 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <stdio.h>
FILE*fin,*fout;
int n,i,j,l[100001],ultim[100001],lmax,v[100001],x,max;
int main()
{
fin=fopen("scmax.in","r");
fout=fopen("scmax.out","w");
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++){
fscanf(fin,"%d",&v[i]);
max=0;
for(j=1;j<=i;j++){
if(v[j]<v[i]){
if(l[j]>max){max=l[j];}
}
}
l[i]=1+max;
if(l[i]>lmax){lmax=l[i];}
}
fprintf(fout,"%d",lmax);
fclose(fin);
fclose(fout);
return 0;
}