Pagini recente » Cod sursa (job #1880903) | Cod sursa (job #1299600) | Cod sursa (job #3266599) | Cod sursa (job #567535) | Cod sursa (job #2707402)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,marimeasubsecventei,inceput,capat,mij,pozitiec,maxim;
int nr[100005],best[100005],prec[100005],L[100005];
int cautb(int x)
{
inceput=0;
capat=marimeasubsecventei;
mij=(inceput+capat)/2;
while(inceput<=capat)
{
if(nr[L[mij]]<x && nr[L[mij+1]]>=x)
{
return mij;
}
else
if(nr[L[mij]]<x)
{
inceput=mij+1;
mij=(inceput+capat)/2;
}
else
{
capat=mij-1;
mij=(inceput+capat)/2;
}
}
return marimeasubsecventei;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>nr[i];
}
L[1]=1;
best[1]=1;
for(i=2;i<=n;i++)
{
pozitiec=cautb(nr[i]);
prec[i]=L[pozitiec];
best[i]=pozitiec+1;
L[pozitiec]=i;
if(marimeasubsecventei<pozitiec+1)
{
marimeasubsecventei=pozitiec+1;
}
}
pozitiec=0;
for(i=1;i<=n;i++)
{
if(maxim<best[i])
{
maxim=best[i];
pozitiec=i;
}
}
g<<maxim<<'\n';
return 0;
}