Pagini recente » Cod sursa (job #369026) | Cod sursa (job #2628805) | Cod sursa (job #300908) | Cod sursa (job #2872603) | Cod sursa (job #2542360)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int DIM = 100005;
int v[DIM],best[DIM],L[DIM],p[DIM],nr,n,poz,maxim=0;
void Print(int i)
{
if(p[i]>0)
Print(p[i]);
fout<<v[i]<<" ";
}
int Search(int x)
{
int p,u,m;
p=0;u=nr;m=(p+u)/2;
while(p<=u)
{
if(v[L[m]]<x && v[L[m+1]]>=x)
return m;
else if(v[L[m+1]]<x)
{
p=m+1;
m=(p+u)/2;
}
else
{
u=m-1;
m=(p+u)/2;
}
}
return nr;
}
void Read()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
best[1]=L[1]=1;
L[0]=0;
}
void Solve()
{
nr=1;
for(int i=2;i<=n;i++)
{
poz=Search(v[i]);
p[i]=L[poz];
best[i]=poz+1;
L[poz+1]=i;
if(nr<poz+1)
nr=poz+1;
}
}
void GetMax()
{
for(int i=1;i<=n;i++)
{
if(best[i]>maxim)
{
maxim=best[i];
poz=i;
}
}
}
int main()
{
Read();
Solve();
GetMax();
fout<<maxim<<'\n';
Print(poz);
}