Pagini recente » Cod sursa (job #193369) | Cod sursa (job #2643790)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
int v[100001], poz[100001], o[100001];
int main()
{
int n, i, k, p, u, mij, max1;
bool ok;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
}
k=1;
o[k]=v[1];
for(i=2; i<=n; i++)
{
p=1;
u=k;
ok=0;
while(p<=u && ok==0)
{
mij=(p+u)/2;
if(v[i]<=o[mij] && v[i]>o[mij-1]) ok=1;
else
{
if(v[i]>=o[mij]) p=mij+1;
else u=mij-1;
}
}
if(ok==0)
{
k++;
o[k]=v[i];
poz[i]=k;
max1=k;
}
else
{
poz[i]=mij;
o[mij]=v[i];
max1=mij;
}
}
fout<<k<<"\n";
o[1]=o[k];
k=1;
for(i=n; i>=1; i--)
{
if(v[i]<o[k] && poz[i]==max1-1)
{
k++;
o[k]=v[i];
max1=poz[i];
}
}
for(i=k; i>=1; i--)
{
fout<<o[i]<<' ';
}
}