Pagini recente » Cod sursa (job #2586377) | Cod sursa (job #1355335) | Cod sursa (job #1073968) | Cod sursa (job #227081) | Cod sursa (job #1251958)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,a[10002],b[10002];
int caut(int a[], int n, int val)
{
int st, dr, m;
st=1;
dr=n;
while(st<=dr)
{
m=(st+dr)/2;
if(a[m]<val && a[m+1]>=val)
return m;
if(a[m]<val)
st=m+1;
else
dr=m-1;
}
return 0;
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++){
fin>>a[i];
b[i]=1<<28;
}
b[n+1]=1<<28;
b[0]=-(1<<28);
int m=0;
for(int i=1;i<=n;i++)
{
int j;
j=caut(b,n,a[i]);
b[j+1]=a[i];
m=max(m,j+1);
}
fout<<m<<"\n";
for(int i=1;i<=m;i++)
fout<<b[i]<<" ";
fin.close();
fout.close();
return 0;
}