比较水的思路dp ,直接用d[ i ] [ j ] 代表最优解,那么枚举所有可行点,
d[ i ][ j ] = max{ d[ i ][ p-1 ]+d[ p+1 ][ j ] +( k+p)*(j-i+1) };
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <map>
using namespace std;
typedef unsigned long long LLU;
typedef long long LL;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const int maxn = 505;
int d[maxn][maxn];
int main()
{
int n,k;
int T,kase=1;
scanf("%d",&T);
while(T--){
scanf("%d %d",&n,&k);
for(int t = 0;t<=n;t++)
for(int i=1;i+t<=n;i++){
int j=i+t;
if(t==0){
d[i][j] = 0; continue;
}
d[i][j] = 1e9;
for(int g=i;g<=j;g++){
int ans =(t+1)*(g+k);
if(i<=g-1) ans+=d[i][g-1];
if(g+1<=j) ans+=d[g+1][j];
d[i][j]=min(d[i][j],ans);
}
}
printf("Case %d: ",kase++);
printf("%d\n",d[1][n]);
}
return 0;
}