ZOJ 3537 Cake (凸包+区间dp)

题意：给出一个多边形，判断一下是不是凸包，再进行最优三角剖分（剖分方法为用不相交的线切割），使得三角形数量最多切割成本最小。

题解：凸包+区间dp
先判断是不是凸包。然后根据点的位置远近排序好的点进行区间dp。
我们用$dp[i][j]$表示剖分$i$到$j$之间的点所需的最小成本。那么就可以得到转移方程：
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + cost[i][k] + cost[k][j])

#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;
const int maxn = 333;
struct point {
	int x, y;
}p[maxn];
point save[maxn], temp[maxn];
int xmult(point p1, point p2, point p0) {
	return (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x) * (p1.y - p0.y);
}
bool cmp(const point& a, const point& b) {
	if (a.y == b.y)return a.x < b.x;
	return a.y < b.y;
}
int Graham(point* p, int n) {
	int i;
	sort(p, p + n, cmp);
	save[0] = p[0];
	save[1] = p[1];
	int top = 1;
	for (i = 0; i < n; i++) {
		while (top && xmult(save[top], p[i], save[top - 1]) >= 0)top--;
		save[++top] = p[i];
	}
	int mid = top;
	for (i = n - 2; i >= 0; i--) {
		while (top > mid && xmult(save[top], p[i], save[top - 1]) >= 0)top--;
		save[++top] = p[i];
	}
	return top;
}
int n, m, cost[maxn][maxn], dp[maxn][maxn];
int main() {
	while (~scanf("%d%d", &n, &m)) {
		for (int i = 0; i < n; i++) scanf("%d%d", &p[i].x, &p[i].y);
		if (Graham(p, n) < n) {
			puts("I can't cut."); 
			continue;
		}
		memset(cost, 0, sizeof(cost));
		for (int i = 0; i < n; i++) {
			for (int j = i + 2; j < n; j++) {
				cost[i][j] = cost[j][i] = abs(save[i].x + save[j].x) * abs(save[i].y + save[j].y) % m;
			}
		}
		memset(dp, 0x3f, sizeof(dp));
		for (int i = 0; i <= n - 2; i++) dp[i][i + 1] = 0;
		dp[n - 1][0] = 0;
		for (int i = n - 3; i >= 0; i--) {
			for (int j = i + 2; j <= n - 1; j++) {
				for (int k = i + 1; k <= j - 1; k++) {
					dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + cost[i][k] + cost[k][j]);
				}
			}
		}
		printf("%d\n", dp[0][n - 1]);
	}
	return 0;
}