Pagini recente » Cod sursa (job #262667) | Cod sursa (job #2790059) | Cod sursa (job #91250) | Cod sursa (job #2037415) | Cod sursa (job #2477374)
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in"); ofstream g("scmax.out");
int N,cnt,v[100005],P[100005],Q[100005];
int main(void)
{ f>>N;
for(int i=1;i<=N;++i) f>>v[i];
for(int i=1;i<=N;++i)
{ if(v[i]>P[cnt]) {P[++cnt]=v[i]; Q[i]=cnt;}
else
{ int st=1,dr=cnt,x=cnt;
while(st<=dr)
{ int m=(st+dr)/2;
if(P[m]<v[i]) st=m+1; else {dr=m-1; x=m;}
}
P[x]=v[i]; Q[i]=x;
}
}
g<<cnt<<'\n';
int j=0;
for(int i=N;i && cnt;--i)
if(Q[i]==cnt) {P[++j]=v[i]; --cnt;}
for(int i=j;i;--i) g<<P[i]<<' ';
g.close(); return 0;
}