Pagini recente » Cod sursa (job #2943212) | Cod sursa (job #2928658) | Cod sursa (job #962804) | Cod sursa (job #1507375) | Cod sursa (job #1037953)
#include<cstdio>
#define NMAX 5000+5
#define oo (1<<30)
using namespace std;
int N,Vmin,Amin,p;
int V[NMAX],A[NMAX],T[NMAX];
void write(int x)
{
printf("%d ",x);
if(x==T[x]) return;
write(T[x]);
}
int main()
{
int i,j;
freopen("subsir2.in","r",stdin);
freopen("subsir2.out","w",stdout);
scanf("%d",&N);
for(i=1; i<=N; i++) scanf("%d",&V[i]);
for(i=N; i>=1; i--)
{
Vmin=Amin=oo;
for(j=i+1; j<=N; j++)
if(V[j]>=V[i] && V[j]<Vmin)
{
Vmin=V[j];
if(A[j]<=Amin)
{
Amin=A[j];
p=j;
}
}
if(Vmin==oo)
{
A[i]=1;
T[i]=i;
}
else
{
A[i]=Amin+1;
T[i]=p;
}
}
Amin=A[1];
p=1;
Vmin=V[1];
for(i=2; i<=N; i++)
if(V[i]<Vmin)
{
Vmin=V[i];
if(A[i]<=Amin)
{
Amin=A[i];
p=i;
}
}
printf("%d\n",Amin);
write(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;
}