E - Multiplication Puzzle（区间dp）

Input

The first line of the input contains the number of cards N (3 <= N <= 100). The second line contains N integers in the range from 1 to 100, separated by spaces.

Output

Output must contain a single integer - the minimal score.

Sample Input

6
10 1 50 50 20 5

Sample Output

3650

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 105;
const int INF = 0x3f3f3f3f;

int cost[N];
long long dp[N][N];

int main(void)
{
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++){
		cin >> cost[i];
	}
	for (int len = 2; len < n; len++){
		for (int i = 1; i <= n - len; i++){
			int j = i + len;
			dp[i][j] = INF;
			for (int k = i + 1; k <= j - 1; k++)
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + cost[k] * cost[i] * cost[j]); 
		}
	}
	cout << dp[1][n] << endl;
	return 0;
}