Pagini recente » Cod sursa (job #1358472) | Cod sursa (job #830788) | Cod sursa (job #549227) | Cod sursa (job #1928104) | Cod sursa (job #215282)
Cod sursa(job #215282)
#include<stdio.h>
int max,p,u,mij,n,i,x,X[100011],v[100011],t[100011],sol[100011];
int main(){
FILE *f=fopen("scmax.in","r");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
fclose(f);
//v[i] = valorile
//X[i] = val cea mai mica in care se termina un subsir strict crescator de lungime i
//t[i] = poz valorii din care s-a format val i
X[1]=1;
t[1]=0;
x=1;
for(i=2;i<=n;i++){
p=1;
u=x;
while(p<=u){
mij=(p+u)/2;
if(v[X[mij]] >= v[i] )
u=mij-1;
else
p=mij+1;
}
if(u == x){
t[i]=X[x];
x++;
X[x]=i;
}
else{
t[i]=X[u];
X[p]=i;
}
}
for(i=1;i<=n;i++){
if(X[i])
max=i;
else
break;
}
int j;
j=X[max];
for(i=max;i>=1;i--){
sol[i]=v[j];
j=t[j];
}
FILE *g=fopen("scmax.out","w");
fprintf(g,"%d\n",max);
for(i=1;i<=max;i++)
fprintf(g,"%d ",sol[i]);
fclose(g);
return 0;
}