Pagini recente » Cod sursa (job #894030) | Cod sursa (job #690693) | Cod sursa (job #888698) | Cod sursa (job #2602356) | Cod sursa (job #1951029)
#include <cstdio>
int n,k,poz,i,ult,a[100005],v[100005],tata[100005];
int cautare(int st, int dr, int nr)
{
int mij;
while (st<=dr)
{
mij=(st+dr)/2;
if (a[v[mij]]==nr) return mij;
else if (a[v[mij]]<nr) st=mij+1;
else dr=mij-1;
}
return st;
}
void afisare(int ult)
{
if (tata[ult]!=0) afisare(tata[ult]);
printf("%d ",a[ult]);
}
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for (i=1; i<=n; i++)
{
scanf("%d",&a[i]);
poz=cautare(1,k,a[i]);
v[poz]=i;
tata[i]=v[poz-1];
if (poz>k)
{
k=poz;
ult=i;
}
}
printf("%d\n",k);
afisare(ult);
return 0;
}