Pagini recente » Cod sursa (job #989306) | Cod sursa (job #826747) | Cod sursa (job #706331) | Cod sursa (job #1412845) | Cod sursa (job #1098381)
#include <fstream>
#define NMAX 100001
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[NMAX],best[NMAX],poz[NMAX],n,sol[NMAX],pozcrt=1;
void citire();
int cautare(int x);
int main()
{
int i,st,dr,mijl,x,aux;
citire();
for (i=1; i<=n; i++)
{
if (a[i]>best[pozcrt-1])
{
best[pozcrt]=a[i];
poz[i]=pozcrt++;
}
else
{
aux=cautare(a[i]);
best[aux]=a[i];
poz[i]=aux;
}
}
x=pozcrt;
fout<<pozcrt-1<<'\n';
for (i=n; i>=1; i--)
{
if (poz[i]==pozcrt-1) sol[pozcrt--]=a[i];
}
for (i=2; i<=x; i++) fout<<sol[i]<<' ';
return 0;
}
void citire()
{
int i;
fin>>n;
for (i=1; i<=n; i++) fin>>a[i];
}
int cautare(int x)
{
int st,dr,mijl;
st=1; dr=pozcrt-1;
while (st<=dr)
{
mijl=(st+dr)/2;
if (best[mijl]<=x) st=mijl+1;
else dr=mijl-1;
}
return st;
}