Cod sursa(job #1857679)
Utilizator | Data | 26 ianuarie 2017 15:36:58 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <stdio.h>
#include <stdlib.h>
int v[100001];
int v2[100001];
int main()
{
FILE *fin=fopen("c.in","r"),*fout=fopen("c.out","w");
int i,j,n,max;
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++){
fscanf(fin,"%d",&v[i]);
}
v2[1]=0;
for(i=2;i<=n;i++){
max=0;
for(j=i-1;j>=1;j--){
if(v[j]<v[i]){
if(v2[j]>max)
max=v2[j];
}
}
v2[i]+=(max+1);
}
max=0;
for(i=1;i<=n;i++){
if(v2[i]>max)
max=v2[i];
}
fprintf(fout,"%d",max+1);
return 0;
}