Pagini recente » Cod sursa (job #2840382) | Cod sursa (job #2679115) | Cod sursa (job #944171) | Cod sursa (job #2335921) | Cod sursa (job #3129797)
#include<fstream>
using namespace std;
ifstream F("scmax.in");
ofstream G("scmax.out");
int i,n,a[100001],b[100001],p[100001],j,k,m;
int main()
{
for(F>>n,i=1;i<=n;++i) {
if(F>>a[i],a[b[m]]<a[i])
p[i]=b[m],b[++m]=i;
for(j=0,k=m;j<k;a[b[(j+k)/2]]<a[i]?j=(j+k)/2+1:k=(j+k)/2);
if(a[i]<a[b[j]])
j?p[i]=b[j-1]:0,b[j]=i;
}
for(i=m,j=b[m];i--;b[i]=j,j=p[j]);
for(G<<m<<'\n',i=0;i<m;G<<a[b[i++]]<<' ');
return 0;
}