Pagini recente » Cod sursa (job #942752) | Cod sursa (job #752610) | Cod sursa (job #1667437) | Cod sursa (job #1117942) | Cod sursa (job #1996361)
#include<cstdio>
using namespace std;
const int nmax=5005;
int v[nmax],d[nmax],t[nmax];
int main()
{
freopen("subsir2.in","r",stdin);
freopen("subsir2.out","w",stdout);
int n,i,j;
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&v[i]);
d[n]=1;
t[n]=n;
int minim,maxim;
for(i=n-1;i;--i)
{
d[i]=1;
maxim=0;
t[i]=i;
for(j=i+1;j<=n;++j)
{
if(maxim<d[j]&&v[i]<=v[j])
{
maxim=d[j];
d[i]=maxim+1;
minim=v[j];
t[i]=j;
}
else if(maxim==d[j]&&minim>v[j])
{
minim=v[j];
t[i]=j;
}
}
}
maxim=0;
minim=0;
for(i=1;i<=n;++i)
{
if(d[i]>d[maxim])
maxim=i;
else if(d[i]==d[maxim]&&v[i]<v[maxim])
maxim=i;
}
printf("%d\n",d[maxim]);
while(t[maxim]!=maxim)
{
printf("%d ",maxim);
maxim=t[maxim];
}
printf("%d ",maxim);
}