Pagini recente » Cod sursa (job #2352374) | Cod sursa (job #2667306) | Istoria paginii preoni-2007/clasament/runda-1/10 | Cod sursa (job #2181363) | Cod sursa (job #2305074)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,d[100000],p,a[100000],v[100000];
int bsh(int x){
int st=1,dr=p;
while(st<=dr){
int mid=(st+dr)/2;
if(v[d[mid]]>x)
dr=mid-1;
else
st=mid+1;
}
return st;
}
void afisare(int p2){
if(a[p2])
afisare(a[p2]);
fout<<v[p2]<<" ";
}
int main(){
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
d[1]=1;
p=1;
for(int i=2;i<=n;i++){
int ps=bsh(v[i]);
if(ps>p)
d[++p]=i;
else
d[ps]=i;
a[i]=d[ps-1];
}
fout<<p<<"\n";
afisare(d[p]);
return 0;
}