Pagini recente » Cod sursa (job #2754121) | Cod sursa (job #1554163) | Cod sursa (job #2494653) | Cod sursa (job #1901613) | Cod sursa (job #976873)
Cod sursa(job #976873)
#include <fstream>
using namespace std;
int n,sol[5005],bf[5005],v[5005],i,j,min1,p,s;
int main()
{
ifstream f("subsir2.in");
ofstream g("subsir2.out");
f>>n;
for (i=1;i<=n;++i)
f>>v[i];
for (i=n;i>0;--i)
{
min1=1111111;
s=min1;
for (j=i+1;j<=n;++j)
if ((v[j]>=v[i]) && (v[j]<min1))
{
min1=v[j];
if (sol[j]<=s)
s=sol[j],p=j;
}
if (min1==1111111)
sol[i]=1;
else
sol[i]=sol[p]+1,bf[i]=p;
}
min1=sol[1],p=1,j=v[1];
for (i=2;i<=n;++i)
if (v[i]<j)
{
j=v[i];
if (sol[i]<=min1)
min1=sol[i],p=i;
}
g<<min1<<"\n"<<p<<" ";
min1--;
while(min1)
{
min1--;
p=bf[p];
g<<p<<" ";
}
return 0;
}