<a target=_blank href="https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=848&page=show_problem&problem=1212"><a target=_blank href="https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=848&page=show_problem&problem=1212" style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);">UVA - 10271</a></a>
这题的状态是第i根筷子是否参与构成第j双,由于存在第三根筷子,需要加限制条件i>=j*3,然后从大到小排序取。状态方程dp[i][j]=min(dp[i-1][j],dp[i-2][j]+w);
#include <cstdio>
#include <cmath>
#include <cstring>
#include <queue>
#include <utility>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 5050;
int T,k,n,a[maxn],dp[maxn][maxn];
int main() {
scanf("%d",&T);
while(T--){
scanf("%d%d",&k,&n);
k+=8;
for(int i=n;i>=1;i--)
scanf("%d",&a[i]);
memset(dp,INF,sizeof(dp));
for(int i=0;i<=n;i++)
dp[i][0]=0;
for(int i=3;i<=n;i++)
for(int j=1;j<=k;j++)
if (i>=j*3) dp[i][j]=min(min(dp[i][j],dp[i-1][j]),dp[i-2][j-1]+(a[i]-a[i-1])*(a[i]-a[i-1]));
printf("%d\n", dp[n][k]);
}
return 0;
}