Pagini recente » Cod sursa (job #1146623) | Cod sursa (job #2534305) | Cod sursa (job #363240) | Cod sursa (job #2598852) | Cod sursa (job #559753)
Cod sursa(job #559753)
#include<cstring>
#include<fstream>
int best[100000+10],L[100000+10],poz[100000+10],n,nr=1,v[100000+10];
std::ifstream fin("scmax.in");
std::ofstream fout("scmax.out");
void afis(int i)
{
if(poz[i]>0)
afis(poz[i]);
fout<<v[i]<<' ';
}
inline int caut_bin(int x)
{
int p=0,u=nr,m=(p+u)/2;
while(p<=u)
{
if(x>v[L[m]] && x<=v[L[m+1]])
return m;
else if(x<v[L[m]])
{
u=m-1;
m=(p+u)/2;
}
else
{
p=m+1;
m=(p+u)/2;
}
}
return nr;
}
int main()
{
fin>>n;
int i;
for(i=1;i<=n;++i)
fin>>v[i];
L[0]=0;
L[1]=best[1]=1;
int max=0,pozmax=0;
memset(poz,0xff,sizeof(poz));
for(i=2;i<=n;++i)
{
int p=caut_bin(v[i]);
best[i]=p+1;
L[p+1]=i;
poz[i]=L[p];
if(best[i]>nr)
{
nr=best[i];
pozmax=i;
}
}
fout<<nr<<'\n';
afis(pozmax);
fout<<'\n';
}