POJ 1651 Multiplication Puzzle（区间DP）

思路：明显的区间DP，dp[l][r] = min{dp[l][k] + dp[k][r] + a[l] * a[r] * a[k]}

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 105;
const int INF = 0x3f3f3f3f;

int n, a
, dp

;

int main() {
while (~scanf("%d", &n)) {
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int len = 2; len < n; len++) {
for (int l = 1; l + len <= n; l++) {
int r = l + len;
dp[l][r] = INF;
for (int k = l + 1; k <= r - 1; k++) {
dp[l][r] = min(dp[l][r], dp[l][k] + dp[k][r] + a[l] * a[k] * a[r]);
}
}
}
printf("%d\n", dp[1]
);
}
return 0;
}