Pagini recente » Cod sursa (job #113479) | Cod sursa (job #407943) | Istoria paginii utilizator/vehuiah | Monitorul de evaluare | Cod sursa (job #214971)
Cod sursa(job #214971)
#include<stdio.h>
int sol[100011],max,p,u,mij,n,i,v[100011],x,X[100011],t[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);
X[1]=1;
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){
if(v[i]>v[X[x]]){
t[i]=X[x];
x++;
X[x]=i;
}
// else{
// t[i]=t[X[u]];
//X[u]=i;
//}
}
else{
t[i]=t[X[p]];
X[p]=i;
}
}
for(i=1;i<=n;i++){
if(X[i])
max=i;
else
break;
}
FILE *g=fopen("scmax.out","w");
fprintf(g,"%d\n",max);
int j=X[max];
for(i=max;i>=1;i--){
sol[i]=v[j];
j=t[j];
}
for(i=1;i<=max;i++)
fprintf(g,"%d ",sol[i]);
fclose(g);
return 0;
}