Pagini recente » Cod sursa (job #317229) | Cod sursa (job #1921979) | Cod sursa (job #368132) | Cod sursa (job #2909715) | Cod sursa (job #2175906)
#include <iostream>
#include <fstream>
#define MAX 100020
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, v[MAX], l[MAX], sol[MAX], p[MAX];
int cautare_binara(int st, int dr, int nr)
{
if(st==dr)
return st;
if(st<dr)
{
int mij = (st+dr)/2;
if(nr<=l[mij])
cautare_binara(st, mij, nr);
else cautare_binara(mij+1, dr, nr);
}
}
void secv()
{
l[0]=0;
int ls, ld;
ls=ld=0;
for(int i=1; i<=n; i++)
{
if(v[i]>l[ld])
{
ld++;
l[ld]=v[i];
p[i]=ld;
}
else
{
int rez = cautare_binara(ls, ld, v[i]);
l[rez] = v[i];
p[i]=rez;
}
}
cout<<ld<<'\n';
int i = n;
int cld = ld;
while(ld)
{
if(p[i]==ld)
{
sol[ld] = v[i];
ld--;
}
i--;
}
g<<cld<<'\n';
for(int i=1; i<=cld; i++)
g<<sol[i]<<" ";
}
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
secv();
}