Pagini recente » Cod sursa (job #2039008) | Cod sursa (job #2025684) | Cod sursa (job #366771) | Cod sursa (job #2321520) | Cod sursa (job #1844088)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,v[100001];
int b[100001],lgmax;
int t[100001];
int l[100001];
int e[100001],ct;
int nr;
int caut(int x)
{
int lo,hi,mid;
lo=0;
hi=lgmax;
while(lo<=hi)
{
mid=lo+(hi-lo)/2;
if(v[l[mid]]<x&&v[l[mid+1]]>=x)
return mid;
else if(v[l[mid+1]]<x)
lo=mid+1;
else
hi=mid-1;
}
return lgmax;
}
void rez()
{
int poz,i;
lgmax=1;
l[0]=0;
b[1]=l[1]=1;
for(i=2;i<=n;i++)
{
poz=caut(v[i]);
t[i]=l[poz];
b[i]=poz+1;
l[poz+1]=i;
if(lgmax<poz+1)
lgmax=poz+1;
}
}
void afis(int poz)
{
if(poz==0)
return;
afis(t[poz]);
e[++ct]=v[poz];
}
void print()
{
int i;
fout<<lgmax<<"\n";
for(i=1;i<=n;i++)
if(b[i]==lgmax)
{
afis(i);
return ;
}
}
int main()
{
int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
rez();
print();
for(i=1;i<=ct;i++)
fout<<e[i]<<" ";
return 0;
}