Pagini recente » Cod sursa (job #849435) | Cod sursa (job #2055651) | Cod sursa (job #1828213) | Cod sursa (job #438229) | Cod sursa (job #945130)
Cod sursa(job #945130)
#include <fstream>
#define nr 100001
#include <algorithm>
using namespace std;
int a[nr],stiva[nr],p[nr],i,j,n,mx,mij,st,dr,lmax,pz,k,v[nr],poz;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for (i=1; i<=n; i++) f>>a[i];
stiva[1]=a[1];
lmax=1;
p[1]=1;
for (i=2; i<=n; i++)
{
st=1;
dr=lmax;
pz=0;
while (st<= dr && pz==0 )
{
mij=(st+dr)/2;
if (stiva[mij]==a[i] ) pz=mij;
else if (stiva[mij]>a[i]) dr=mij-1;
else st=mij+1;
}
if (pz==0) pz=st;
stiva[pz]=a[i];
if (st>lmax) lmax=st;
p[i]=pz;
if (p[i]>mx) mx=p[i];
}
for (i=1; i<=n; i++) if (p[i]==mx) poz=i;
k=1;
v[1]=a[poz];
lmax=p[poz];
for (i=poz-1; i>=1; i--) if (p[i]==lmax-1)
{
lmax--;
k++;
v[k]=a[i];
}
g<<k<<'\n';
reverse(v+1,v+k+1);
for (i=1;i<=k;i++) g<<v[i]<<" ";
f.close();
g.close();
return 0;
}