Pagini recente » Cod sursa (job #2736470) | Cod sursa (job #1399671) | Cod sursa (job #246120) | Cod sursa (job #2713678) | Cod sursa (job #2666300)
#include <fstream>
#define NMAX 100008
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,a[NMAX],best[NMAX],lgbest,poz[NMAX],sol[NMAX];
int cautare_binara(int x);
int main()
{
int i,j,pozaux;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
if(a[i]>best[lgbest])
{
best[++lgbest]=a[i];
poz[i]=lgbest;
}
else if(a[i]<best[lgbest])
{
pozaux=cautare_binara(a[i]);
best[pozaux]=a[i];
poz[i]=pozaux;
}
}
fout<<lgbest<<'\n';
for(i=lgbest,j=n; i>0; j--)
if(poz[j]==i)
{
sol[i]=a[j];
i--;
}
for(i=1; i<=lgbest; i++)
fout<<sol[i]<<' ';
return 0;
}
int cautare_binara(int x)
{
int st=0,dr=lgbest,mijl;
while(dr-st>1)
{
mijl=(dr+st)/2;
if(best[mijl]>=x)
dr=mijl;
else st=mijl;
}
return dr;
}