Pagini recente » Cod sursa (job #3137263) | Cod sursa (job #1760649) | Cod sursa (job #1592331) | Cod sursa (job #2717087) | Cod sursa (job #543053)
Cod sursa(job #543053)
#include<fstream>
using namespace std;
ofstream g("subsir2.out");
int i,j,n,m,a[5001],b[5001],l[5001],p[5001],x,nr=1;
void afis(int i)
{
if(p[i]>0)
afis(p[i]);
g<<i<<" ";
}
int cauta(int x)
{
int st=0,dr=nr,mij;
mij=(st+dr)/2;
while(st<=dr)
{
if(a[l[mij]]<x&&a[l[mij+1]]>=x)
return mij;
else
if(a[l[mij+1]]<=x)
st=mij+1,mij=(st+dr)/2;
else
dr=mij-1,mij=(st+dr)/2;
}
return nr;
}
int main()
{
ifstream f("subsir2.in");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
l[0]=0;
l[1]=b[1]=1;
for(i=2;i<=n;i++)
{
x=cauta(a[i]);
b[i]=x+1;
l[x+1]=i;
p[i]=l[x];
if(nr<x+1)
nr=x+1;
}
int max1=0,poz=0;
for(i=1;i<=n;i++)
if(b[i]>max1)
{
max1=b[i];
poz=i;
}
g<<max1<<"\n";
afis(poz);
return 0;
}