Pagini recente » Cod sursa (job #885990) | Cod sursa (job #2594533) | Cod sursa (job #1656804) | Cod sursa (job #2910440) | Cod sursa (job #554678)
Cod sursa(job #554678)
#include<fstream>
#include<cstdio>
int n,best[100010],v[100010],L[100010],poz[100010],nr=1;
std::ifstream fin("scmax.in");
std::ofstream fout("scmax.out");
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;
if(x>v[L[m+1]])
{
p=m+1;
m=(p+u)/2;
}
else
{
u=m-1;
m=(p+u)/2;
}
}
return nr;
}
inline void afiseaza(int i)
{
if(poz[i]>0)
afiseaza(poz[i]);
fout<<v[i]<<' ';
}
int main()
{
fin>>n;
for(int i=1;i<=n;++i)
{
fin>>v[i];
}
L[0]=0;
L[1]=best[1]=1;
int poz2;
for(int i=2;i<=n;++i)
{
poz2=caut_bin(v[i]);
best[i]=poz2+1;
L[best[i]]=i;
poz[i]=L[poz2];
if(nr<best[i])
{
nr=best[i];
//pozmax=i;
}
}
int pozmax=0,maxim=0;
for(int i=1;i<=n;++i)
{
if(maxim<best[i])
{
maxim=best[i];
pozmax=i;
}
}
fout<<maxim<<'\n';
afiseaza(pozmax);
fout<<'\n';
return 0;
}