Pagini recente » Cod sursa (job #330258) | Cod sursa (job #1406426) | Cod sursa (job #2837311) | Cod sursa (job #749382) | Cod sursa (job #2075894)
#include <iostream>
#include <fstream>
using namespace std;
int v[100001],p[100001],q[100001],ans[100001];
int main()
{
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
int n,i,j,k=0,sf,st,dr,mij,sol;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
sf=1;
q[1]=v[1];
p[1]=1;
for(i=2;i<=n;i++)
{
st=1;
dr=sf;
sol=0;
while(st<=dr)
{
mij=(st+dr)/2;
if(q[mij]>=v[i]){
dr=mij-1;
sol=mij;
}
else
st=mij+1;
}
if(sol!=0)
{
q[sol]=v[i];
p[i]=sol;
}
else
{
sf++;
q[sf]=v[i];
p[i]=sf;
}
}
for(i=n;i>0;i--)
{
if(p[i]==sf)
{
ans[++k]=v[i];
sf--;
}
}
fout<<k<<"\n";
for(i=k;i>0;i--)
fout<<ans[i]<<" ";
return 0;
}