Pagini recente » Cod sursa (job #2225594) | Cod sursa (job #2029473) | Cod sursa (job #1023663) | Cod sursa (job #3148770) | Cod sursa (job #2967555)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100001],l[100001],val_min[100001];
void refac_subsir(int p, int val, int lung)
{
if (lung == 1)
{
return;
}
if (v[p] < val && l[p] == lung - 1)
{
refac_subsir(p - 1, v[p], l[p]);
fout << v[p] << " ";
}
else
{
refac_subsir(p - 1, val, lung);
}
}
int cautbin(int x[],int n, int val)
{
int st=1,dr=n,rez=0;
while(st<=dr)
{
int mij=(st+dr)/2;
if(x[mij]<val)
{
st=mij+1;
rez=mij;
}
else
dr=mij-1;
}
return rez;
}
int main()
{
int n,minn=0,pmax=1;
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<=n;i++)
{
int j=cautbin(val_min,minn,v[i]);
if(j==minn)
minn++;
l[i]=j+1;
val_min[l[i]]=v[i];
if(l[i]>l[pmax])
pmax=i;
}
fout<<l[pmax]<<'\n';
refac_subsir(pmax,v[pmax]+1,l[pmax]+1);
return 0;
}