Gym 101196F Removal Game （环形区间dp）

题意：给出一个序列，每删除一个数的代价是相邻两数的gcd，求最小总代价。

题解：区间dp
区间dp跑完之后，不是枚举每一段长度为n的序列求最小，因为最后剩下的两个元素没有中间值，所以要接着枚举是哪两个元素，然后更新最小值。
注意预处理gcd。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
int n, a[2111], dp[2111][2111], g[2111][2111];
int gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
	for (int i = 1; i <= 1000; i++) {
		for (int j = 1; j <= 1000; j++) {
			g[i][j] = gcd(i, j);
		}
	}
	while (~scanf("%d", &n) && n) {
		for (int i = 1; i <= n; i++) {
			scanf("%d", &a[i]);
			a[i + n] = a[i];
		}
		memset(dp, 0x3f, sizeof(dp));
		for (int i = 1; i < 2 * n; i++) dp[i][i] = dp[i][i + 1] = 0;
		for (int i = 2 * n - 1; i >= 1; i--) {
			for (int j = i; j - i <= n; j++) {
				for (int k = i + 1; k < j; k++) {
					dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + g[a[i]][a[j]]);
				}
			}
		}
		int ans = 0x3f3f3f3f;
		for (int i = 1; i <= n; i++) {
			for (int j = i + 1; j <= i + n; j++) {
				ans = min(ans, dp[i][j] + dp[j][i + n] + g[a[i]][a[j]]);
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}