//MADE BY Y_is_sunshine;
//#include <bits/stdc++.h>
//#include <memory.h>
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <cstdio>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define INF 0x3f3f3f3f
#define MAXN 305
const int mod = 1e9 + 7;
using namespace std;
int dp[MAXN][MAXN];
int d[MAXN];
int N;
int main()
{
freopen("data.txt", "r", stdin);
cin >> N;
//memset(dp, 0, sizeof(dp));
memset(dp, 0x3f, sizeof(dp));
for (int i = 1; i <= N; i++)
scanf("%d", &d[i]),dp[i][i] = 0;
for (int len = 1; len < N ; len++) {
for (int i = 1; i <= N - len; i++) {
int end = i + len;
//dp[i][end] = INF;
for (int k = i; k < end; k++)
dp[i][end] = min(dp[i][end], dp[i][k] + dp[k + 1][end] + d[k] * d[i - 1] * d[end]);
}
}
cout << dp[2][N] << endl;
freopen("CON", "r", stdin);
system("pause");
return 0;
}
区间DP POJ1654
最新推荐文章于 2019-12-12 16:32:29 发布