Pagini recente » Cod sursa (job #1886537) | Cod sursa (job #2185428) | Cod sursa (job #1462142) | Cod sursa (job #1118091) | Cod sursa (job #499021)
Cod sursa(job #499021)
#include<fstream>
using namespace std;
ofstream g("subsir2.out");
int i,j,n,m,v[501],best[510],l[510],p[510],max1,poz,nr;
void afis(int i)
{
if(p[i]>0)
afis(p[i]);
g<<v[i]<<" ";
}
int cauta(int x)
{
int st=0,dr=nr,m;
m=(st+dr)/2;
while(st<=dr)
{
if(v[l[m]]<x&&v[l[m+1]]>=x)
return m;
else
if(v[l[m+1]]<x)
st=m+1,m=(st+dr)/2;
else
dr=m-1,m=(st+dr)/2;
}
return nr;
}
int main()
{
ifstream f("subsir2.in");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l[1]=best[1]=1;
l[0]=0;
nr=1;
for(i=2;i<=n;i++)
{
poz=cauta(v[i]);
best[i]=poz+1;
p[i]=l[poz];
l[poz+1]=i;
if(poz+1>nr)
nr=poz+1;
}
poz=0;
v[0]=100000;
for(j=nr;j>=1;j--)
{
max1=j;
for(i=1;i<=n;i++)
if(best[i]==max1&&v[i]<v[poz])
poz=i;
l[j]=poz;
}
g<<nr<<"\n";
for(i=1;i<=nr;i++)
g<<l[i]<<" ";
return 0;
}