Pagini recente » Cod sursa (job #2294673) | Cod sursa (job #470760) | Cod sursa (job #1733678) | Cod sursa (job #2931448) | Cod sursa (job #1129264)
# include <fstream>
# define N 100010
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int a[N],p[N],sol[N],v[N];
int n,i;
int bs(int st, int dr, int x)
{
int m;
while(st<=dr)
{
m=(st+dr)/2;
if(v[m]==x) return m;
else if(v[m]>x) dr=m-1;
else st=m+1;
}
return st;
}
void solve()
{
int i,poz=0,Max=0,k=0,c;
p[1]=1;
v[++v[0]]=a[1];
for(i=2; i<=n; ++i)
{
if(a[i]>v[v[0]])
{
v[++v[0]]=a[i];
p[i]=v[0];
}
else
{
poz=bs(1,v[0],a[i]);
v[poz]=a[i];
p[i]=poz;
}
if(p[i]>Max)
{
Max=p[i];
poz=i;
}
}
g<<Max<<'\n';
sol[++k]=a[poz];
c=poz;
for(i=poz-1; i>=1; --i)
if(p[i]==p[c]-1)
{
sol[++k]=a[i];
c=i;
}
for(i=k; i>=2; --i)
g<<sol[i]<<" ";
g<<sol[1]<<'\n';
}
int main()
{
f>>n;
for(i=1; i<=n; ++i)
f>>a[i];
solve();
}