Pagini recente » Cod sursa (job #1275403) | Cod sursa (job #1796322) | Cod sursa (job #1680888) | Cod sursa (job #1870095) | Cod sursa (job #1089632)
#include <fstream>
#define DMAX 100002
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[DMAX], best[DMAX], poz[DMAX], s[DMAX];
int n;
int lgmax;
void citire(), constr_best(), constr_sir(), afisare();
int cautare_binara(int x, int st, int dr);
int main()
{
citire();
constr_best();
constr_sir();
afisare();
return 0;
}
void citire()
{
int i;
fin>>n;
for (i=0; i<n; i++) fin>>a[i];
}
void constr_best()
{
int i, j;
best[0]=a[0]; poz[0]=0;
for (i=j=1; i<n; i++)
{
if (a[i]>best[j-1]) { best[j]=a[i]; poz[i]=j; ++j;}
else
poz[i]=cautare_binara(a[i], 0, j);
}
lgmax=j-1;
}
int cautare_binara(int x, int st, int dr)
{
int mij;
while (st<dr)
{
mij=(st+dr)/2;
if (x<best[mij]) dr=mij;
else st=mij+1;
}
best[dr]=x; return dr;
}
void constr_sir()
{
// constr subsirul
int i, k=n-1;
for (i=lgmax; i>=0; --i)
{
while (poz[k]!=i) k--;
s[i]=a[k];
}
}
void afisare()
{
int i;
fout<<lgmax+1<<'\n';
for (i=0; i<=lgmax; i++)
fout<<s[i]<<' ';
fout<<'\n';
fout.close();
}