Pagini recente » Cod sursa (job #2218235) | Cod sursa (job #2868517) | Cod sursa (job #2323069) | Cod sursa (job #172105) | Cod sursa (job #520698)
Cod sursa(job #520698)
#include<fstream>
using namespace std;
int a[100003],lungime[100003],pozitii[100003],interval[100003];
int nr,i,n,poz,maxim;
ifstream f("scmax.in");
ofstream g("scmax.out");
int cautarebinara(int x)
{
int st=0,dr,m;
dr=nr;
while(st<=dr)
{
m=(st+dr)/2;
if(a[interval[m]]<x&&a[interval[m+1]]>=x)
return m;
else
if(a[interval[m+1]]>x)
dr=m-1;
else
st=m+1;
}
return nr;
}
void afiseaza(int j)
{
if(pozitii[j]>0)
afiseaza(pozitii[j]);
g<<a[j]<<" ";
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
nr=1;
interval[1]=lungime[1]=1;
interval[0]=0;
for(i=2;i<=n;i++)
{
poz=cautarebinara(a[i]);
pozitii[i]=interval[poz];
lungime[i]=poz+1;
interval[poz+1]=i;
if(nr<poz+1)
nr=poz+1;
}
maxim=0;poz=0;
for(i=1;i<=n;i++)
if(lungime[i]>maxim)
{
maxim=lungime[i];
poz=i;
}
g<<maxim<<"\n";
afiseaza(poz);
return 0;
}