Pagini recente » Cod sursa (job #1966961) | Cod sursa (job #2139960) | Cod sursa (job #1087635) | Cod sursa (job #1018053) | Cod sursa (job #2723224)
#include <bits/stdc++.h>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int lim=1e5+4;
const int inf=2e9+7;
int prd[lim];
int bst[lim];
int cur[lim];
int v[lim];
int main()
{
int n;
in>>n;
for(int i=1;i<=n;++i)
{
in>>v[i];
bst[i]=inf;
cur[i]=0;
}
int lmax=0,capp=0;
for(int i=1;i<=n;++i)
{
int l=0,r=lmax,med;
while(l<r)
{
if(r==l+1)
med=r;
else med=(l+r)/2;
if(v[i]>bst[med])
l=med;
else r=med-1;
}
if(l==lmax)
{
capp=i;
prd[i]=cur[lmax];
++lmax;
cur[lmax]=i;
bst[lmax]=v[i];
}
else
{
prd[i]=cur[l];
cur[l+1]=i;
bst[l+1]=v[i];
}
}
out<<lmax<<'\n';
vector<int> ans;
for(int i=1;i<=lmax;++i)
{
ans.push_back(capp);
capp=prd[capp];
}
for(int i=ans.size()-1;i>=0;--i)
out<<v[ans[i]]<<' ';
return 0;
}