Pagini recente » Cod sursa (job #786629) | Cod sursa (job #2290006) | Cod sursa (job #2611543) | Cod sursa (job #1690189) | Cod sursa (job #986089)
Cod sursa(job #986089)
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout("scmax.out");
int v[100001],s[100001],l[100001],last,j,lo,hi,n,m;
int main ()
{
fin>>n;
for (int i=1;i<=n;i++)
{
fin>>v[i];
if (v[i]>s[last]) s[++last]=v[i],l[i]=last;
else
{
lo=0;
hi=last+1;
while (hi-lo>1)
{
m=(lo+hi)/2;
if (v[i] <= s[m]) hi=m;
else lo=m;
}
s[hi] = v[i];
l[i] = hi;
}
}
fout<<last<<"\n";
j=last;
for (int i=n;i>0;i--)
{
if (j!=l[i]) continue;
s[j]=v[i];
j--;
}
for (j=1;j<=last;j++) fout<<s[j]<<" ";
}