题目:
解题思路
dp
先用题目的公式预处理er[i][j](i~j只选i和j)
然后
然后用k枚举0~i-1,计算出f[i]j
然后用f[i][j]计算出出ans[i][j]
转移方程:
f[i][j]=min(f[i][j],f[k][j−1]+er[k][i]);
f
[
i
]
[
j
]
=
m
i
n
(
f
[
i
]
[
j
]
,
f
[
k
]
[
j
−
1
]
+
e
r
[
k
]
[
i
]
)
;
&
ans[i]=min(ans[i],f[j][i]+er[j][n+1]);
a
n
s
[
i
]
=
m
i
n
(
a
n
s
[
i
]
,
f
[
j
]
[
i
]
+
e
r
[
j
]
[
n
+
1
]
)
;
源程序:
#include <cstdio>
#include <cstring>
#define N 101
#define min(a,b) a>b?b:a
#define r(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
int n,e,a[N],er[N][N],f[N][N],ans[N];
int abs(int x) {return x>0?x:-x;}
int main()
{
scanf("%d%d",&n,&e);
r(i,1,n)
scanf("%d",&a[i]);
memset(f,30,sizeof(f));
memset(ans,30,sizeof(ans));
r(i,1,n)
{
r(j,1,i-1)
er[0][i]+=(abs(a[j]-a[i]))<<1;
r(j,i+1,n)
{
er[i][n+1]+=(abs(a[j]-a[i]))<<1;
r(k,i+1,j-1)
er[i][j]+=abs(2*a[k]-a[i]-a[j]);
}
}
f[0][0]=0;
r(i,1,n)
r(j,1,i)
r(k,0,i-1)
f[i][j]=min(f[i][j],f[k][j-1]+er[k][i]);
r(i,1,n)
r(j,i,n)
ans[i]=min(ans[i],f[j][i]+er[j][n+1]);
r(i,1,n)
if (ans[i]<=e)
return printf("%d %d",i,ans[i])&0;
}