Pagini recente » Cod sursa (job #2206827) | Cod sursa (job #2734530) | Cod sursa (job #1520767) | Cod sursa (job #1979741) | Cod sursa (job #2081806)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, m, q, a[100002], t[100002], pv[100002], sol[100002];
int bs(int x)
{
int st=1, dr=m, mijl;
while(st<=dr)
{
mijl=st+(dr-st)/2;
if(x<=a[t[mijl]])
dr=mijl-1;
else
st=mijl+1;
}
return st;
}
int main()
{
int i, k;
fin>>n;
for(i=1; i<=n; i++) fin>>a[i];
t[1]=1;
m=1;
for(i=2; i<=n; i++)
{
k=bs(a[i]);
t[k]=i;
pv[i]=t[k-1];
m=max(m,k);
}
fout<<m<<'\n';
for(i=t[m]; i>0; i=pv[i])
sol[++q]=a[i];
for(i=q; i>=1; i--)
fout<<sol[i]<<' ';
return 0;
}