Pagini recente » Cod sursa (job #1133130) | Cod sursa (job #172721) | Cod sursa (job #1688099) | Cod sursa (job #788210) | Cod sursa (job #1862387)
#include<fstream>
using namespace std;
int v[100003],t[100003],d[100003],sol[10003],n,i,j,st,dr,k,mj;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>v[i];
k=1;
d[1]=1;
for(i=2;i<=n;i++)
{st=1;
dr=k;
while(st<=dr)
{mj=(st+dr)/2;
if(v[d[mj]]<v[i])
st=mj+1;
else
dr=mj-1;
}
if(st>k)
k++;
d[st]=i;
t[i]=d[st-1];
}
g<<k<<'\n';
i=d[k];
while(i!=0)
{sol[++j]=i;
i=t[i];}
for(i=k;i>=1;i--)
g<<v[sol[i]]<<" ";
return 0;
}