Pagini recente » Cod sursa (job #1258881) | Cod sursa (job #183016) | Cod sursa (job #557550) | Cod sursa (job #2864914) | Cod sursa (job #2034130)
#include <fstream>
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int n,p,i,j,k,mi,ma,v[5001], l[5001];
int main()
{f>>n;
for(i=1;i<=n;++i)
f>>v[i];
l[n]=1;
for(i=n-1;i>=1;--i)
{
ma=0;
for(j=i+1;j<=n;++j)
if(v[i]<v[j] && l[j]>ma)
ma=l[j];
l[i]=ma+1;
}
ma=0;
for(i=1;i<=n;++i)
if(l[i]>ma)
{
ma=l[i];
k=i;
}
g<<ma<<endl;
g<<k<<" ";
--ma;
for(i=k+1;i<=n;++i)
if(l[i]==ma)
{mi=v[i];
for(j=i+1;j<=n;++j)
if(v[j]<mi && v[k]<v[j])
{
mi=v[j];
p=j;
}
g<<p<<" ";
k=p;
--ma;
}
return 0;
}