Pagini recente » Cod sursa (job #3159570) | Cod sursa (job #1730496) | Cod sursa (job #1691203) | Cod sursa (job #3003696) | Cod sursa (job #2572374)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,pmax,Max,k=1;
int v[100001],st[100001],tata[100001],sol[100001],l[100001];
int caut(int x)
{
int p=1,q=k;
while(p<=q)
{
int mid=(p+q)/2;
if(v[st[mid]]>=x)
q=mid-1;
else
p=mid+1;
}
return p;
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
st[1]=1;
Max=pmax=k;
for(int i=2;i<=n;i++)
{
int pc=caut(v[i]);
st[pc]=i;
k=max(k,pc);l[i]=k;
tata[i]=st[pc-1];
}
for(int i=1;i<=n;i++)
if(l[i]>Max)
Max=l[i],pmax=i;
fout<<Max<<'\n';
int k=1;
sol[1]=v[pmax];
while(tata[pmax]!=0)
{
pmax=tata[pmax];
sol[++k]=v[pmax];
}
for(int i=Max;i>=1;i--)
fout<<sol[i]<<' ';
return 0;
}