Pagini recente » Cod sursa (job #456726) | Cod sursa (job #1520683) | Cod sursa (job #1582112) | Cod sursa (job #2425918) | Cod sursa (job #2510081)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,i,j,m,p,k,u,t[100010],sol[100010],v[100010],d[100010],cnt,st,dr,mid;
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
v[++n]=2000001110;
for(i=1;i<=n;i++){
st=1; dr=cnt;
while(st<=dr){
mid=(st+dr)/2;
if(v[i]>v[d[mid]])
st=mid+1;
else
dr=mid-1;
}
if(st>cnt)
cnt++;
d[st]=i;
t[i]=d[st-1];
}
fout<<cnt-1<<"\n";
u=n;
while(u!=0){
sol[++k]=v[u];
u=t[u];
}
///fout<<k-1<<"\n";
for(;k>=2;k--){
fout<<sol[k]<<" ";
}
return 0;
}