Pagini recente » Cod sursa (job #501580) | Cod sursa (job #1929895) | Cod sursa (job #3154477) | Cod sursa (job #953948) | Cod sursa (job #2267078)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100005],poz[100005],n,best[100005],lgbest,i,j,pozitie,cine,s[100005];
int cauta (int st, int dr);
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
best[++lgbest]=a[1];
for(i=2; i<=n; i++)
{
if(a[i]>best[lgbest])
{
best[++lgbest]=a[i];
poz[i]=lgbest;
}
else
{
pozitie=cauta(0,lgbest+1);
poz[i]=pozitie;
best[pozitie]=a[i];
}
}
fout<<lgbest<<'\n';
cine=lgbest;
for(i=n;i>=1;i--)
{
if(poz[i]==cine)
{
s[cine]=a[i];
cine--;
}
}
for(i=1;i<=lgbest;i++)
fout<<s[i]<<" ";
return 0;
}
int cauta (int st, int dr)
{
int mid;
mid=(st+dr)/2;
if(dr-st>1)
return mid;
else
if(best[mid]>=a[i])
{
cauta(st,mid);
}
else
cauta(mid, dr);
}