Pagini recente » Cod sursa (job #273098) | Cod sursa (job #571158) | Cod sursa (job #1851455) | Cod sursa (job #394796) | Cod sursa (job #3177412)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
int a[1001],n,d[1001],p[1001],in[1001],k;
int main()
{
fin >>n;
for (int i=1;i<=n;i++)
{fin >>a[i];}
k=1;
d[k]=a[1];
p[1]=1;
for (int i=2;i<=n;i++)
{if (a[i]>d[k]) {k++;d[k]=a[i];p[i]=k;}
else {int st=1,dr=k,poz=k+1;
while (st<=dr)
{int m=(st+dr)/2;
if (d[m]>=a[i]) {poz=m;dr=m-1;}
else st=m+1;}
d[poz]=a[i];
p[i]=poz;}}
int j=n;
for (int i=k;i>=1;i--)
{while (p[j]!=i)
j--;
in[i]=j;}
fout <<k<<'\n';
for (int i=1;i<=k;i++)
{
fout <<d[i]<<' ';
}
return 0;
}