Cod sursa(job #721646)
Utilizator | Ioana Bica ioanab | Data | 23 martie 2012 22:33:36 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int N=100005;
int x[N],v[N];
int bs(int val,int n)
{
int i,pas=1<<16;
for (i=0;pas!=0;pas>>=1)
if (i+pas<=n && v[x[i+pas]]<val)
i+=pas;
return i+1;
}
int main()
{
int n,i,nr,j;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
nr=0;
x[++nr]=1;
for(i=2;i<=n;i++)
{
j=bs(v[i],nr);
if(j>nr)
nr++;
x[j]=i;
}
out<<nr<<"\n";
for(i=1;i<=nr;i++)
out<<v[x[i]]<<" ";
return 0;
}