P1063 [NOIP2006 提高组] 能量项链（区间dp）

P1063 [NOIP2006 提高组] 能量项链https://www.luogu.com.cn/problem/P1063

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))


int n;
int f[250][250];
int s[MAXN];

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", s + i);
		s[n + i] = s[i];
	}
	for (int l = 1; l < 2 * n; l++) {
		for (int i = 1; i <= n + n - l; i++) {
			int j = i + l;
			if (j == n + n)
				continue;
			for (int k = i; k < j; k++) {
				f[i][j] = max(f[i][j], f[i][k] + f[k + 1][j] + s[i] * s[k + 1] * s[j + 1]);
			}
		}
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		ans = max(ans, f[i][i + n - 1]);
	}
	printf("%d", ans);
	return 0;
}