Pagini recente » Cod sursa (job #1779308) | Cod sursa (job #2763300) | Cod sursa (job #1711505) | Cod sursa (job #34986) | Cod sursa (job #1251961)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,a[100002],b[100002];
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,j;
for(int i=1;i<=n;i++)
{
j=caut(b,n,a[i]);
b[j+1]=a[i];
}
fout<<j+1<<"\n";
for(int i=1;i<=j+1;i++)
fout<<b[i]<<" ";
fin.close();
fout.close();
return 0;
}