石子合并（环形）

石子合并 LibreOJ - 10147

主要思路：按找线性来做 dp[i][j] = max(dp[i][j], dp[i][k] + dp[k + 1][j] + sum[i][j])
把环形处理成线性即可，直接开2倍数组，如1 3 4 5， 写成 1 3 4 5 1 3 4 5，即可找该数组中找到环形中每一个状态

#include<bits/stdc++.h>

using namespace std;
const int N = 200 * 2 + 10;
int a[N], n;
int sum[N];
int dp[N][N];
int dp1[N][N];
int main()
{
	memset(dp1[0], 0x3f3f3f3f, sizeof dp1);
	//cout << dp1[0][0] << endl;
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
		a[i + n] = a[i];
	}
	int m = n * 2;
	for(int i = 1; i <= m; i++) sum[i] = sum[i - 1] + a[i], dp1[i][i] = 0;
	int minn = 1<<30;
	int maxx = 0;
	for(int len = 1; len < n; len++)
	{
		for(int i = 1; i + len <= m; i++)
		{
			int j = i + len;
			for(int k = i; k < j; k++)
			{
				dp[i][j] = max(dp[i][j], dp[i][k] + dp[k + 1][j] + sum[j] - sum[i - 1]);
				dp1[i][j] = min(dp1[i][j], dp1[i][k] + dp1[k + 1][j] + sum[j] - sum[i - 1]);
			}
			if(len == n - 1)
			{
				maxx = max(dp[i][j], maxx);
				minn = min(minn, dp1[i][j]);
			}
		}
	}/*
		8
		8 + 5
		13 + 9
		8 + 13 + 22
		43
	*/
	cout << minn << endl << maxx << endl;
	return 0;
}