Pagini recente » Cod sursa (job #2186597) | Cod sursa (job #1766595) | Cod sursa (job #2565273) | Cod sursa (job #2933026) | Cod sursa (job #1223183)
# include <fstream>
# include <iostream>
# include <algorithm>
# include <cstring>
using namespace std;
ifstream fi("scmax.in");
ofstream fo("scmax.out");
const int nmax=100005;
const int infi=1<<30;
int S[nmax],V[nmax],s[nmax],v[nmax];
int read()
{
char c[30];
fi>>c;
int k=strlen(c),p=0;
for (int i=0;i<k;++i) p=p*10+c[i]-'0';
return (p);
}
int main(void)
{
int n=read();
for (int i=1;i<=n;++i) S[i]=read();
int MAX=0;
for (int i=1;i<=n;++i)
{
V[i]=infi;
int low=lower_bound(V+1,V+1+i,S[i])-V;
V[low]=S[i];
s[i]=low;
if (low>MAX) MAX=low;
}
int p=n;
while (s[p]!=MAX) --p;
int k=0;
while (p)
{
v[++k]=S[p];
for (int i=p-1;i>=0;--i)
if (s[i]==s[p]-1 && S[i]<S[p])
{
p=i;break;
}
}
fo<<MAX<<"\n";
while (MAX--) fo<<v[MAX]<<" ";
fo<<"\n";
fo.close();
return 0;
}