Pagini recente » Cod sursa (job #1473184) | Cod sursa (job #1506093) | Cod sursa (job #1816488) | Cod sursa (job #1890596) | Cod sursa (job #1996377)
#include<cstdio>
using namespace std;
const int nmax=5005;
int v[nmax],d[nmax],t[nmax];
bool used[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;
d[n]=1;
t[n]=n;
v[0]=1000005;
for(i=n-1;i;--i)
{
maxim=0;
minim=1000005;
for(j=i+1;j<=n;++j)
if(v[i]<=v[j])
{
used[j]=1;
if(v[j]<minim)
{
if(maxim==0||d[maxim]>d[j])
maxim=j;
else if(d[j]==d[maxim]&&v[j]<v[maxim])
maxim=j;
minim=v[j];
}
}
if(maxim==0)
d[i]=1,t[i]=i;
else
d[i]=d[maxim]+1,t[i]=maxim;
}
maxim=0;
for(i=1;i<=n;++i)
if(!used[i])
{
if(maxim==0||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];
}
if(d[maxim])
printf("%d",maxim);
}