Pagini recente » Cod sursa (job #1063884) | Cod sursa (job #2245477) | Cod sursa (job #2659147) | Cod sursa (job #1087391) | Cod sursa (job #2527306)
#include <stdio.h>
#define NMAX 100010
using namespace std;
FILE *f,*g;
int x[NMAX],poz[NMAX],pred[NMAX],v[NMAX],l[NMAX],N;
int BinarySearch(int value,int i)
{
int P=-1,middle,left=1,right=x[0];
while(left<=right)
{
middle=(left+right)/2;
if(x[middle]<value)P=middle,left=middle+1;
else
right=middle-1;
}
if(P==-1)x[1]=value,poz[1]=i;
else x[P+1]=value,pred[i]=poz[P],poz[P+1]=i;
if(P+1>x[0])++x[0];
return P;
}
void Displaying(int pm)
{
if(pm)
{
Displaying(pred[pm]);
fprintf(g,"%d ",v[pm]);
}
}
int main()
{
f=fopen("scmax.in","r");g=fopen("scmax.out","w");
int i,j,P,Max=0,pm;
fscanf(f,"%d%d",&N,&v[1]);
l[1]=1,x[++x[0]]=v[1],poz[1]=1;
for(i=2;i<=N;++i)
{
fscanf(f,"%d",&v[i]);
P=BinarySearch(v[i],i);
if(P+1==x[0])l[P+1]=l[P]+1;
if(l[P+1]>Max)Max=l[P+1],pm=i;
}
fprintf(g,"%d\n",Max);
Displaying(pm);
fclose(f);fclose(g);
return 0;
}