Cod sursa(job #2576933)
Utilizator | Ana Batrineanu anabat | Data | 7 martie 2020 16:27:41 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 5 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <stdio.h>
#include <stdlib.h>
#define NMAX 100000
int v[NMAX+1],d[NMAX+1];
int main()
{
FILE *fin,*fout;
fin=fopen("scmax.in","r");
fout=fopen("scmax.out","w");
int n,i,j,max;
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++){
fscanf(fin,"%d",&v[i]);
}
max=-1;
for(i=1;i<=n;i++){
max=-1;
for(j=1;j<=i;j++){
if(v[j]<v[i]&&d[j]+1>max)
max=d[j];
}
d[i]=max+1;
if(d[i]>max)
max=d[i];
}
fprintf(fout,"%d\n",max+1);
fclose(fin);
fclose(fout);
return 0;
}