poj 1191 棋盘分割 dp（递归写法和递推写法）

http://poj.org/problem?id=1191

https://www.acwing.com/problem/content/323/

 

做高中数学题遇到方差的时候，一般需要化简

为了让方差最小，只需要让xi^2 最小即可

 

对于一个棋盘，我们可以遍历其所有可能的分割方式，最后统计答案。

 

递归做法：

#include<bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int dp[18][10][10][10][10];
//sum ： 二维前缀和
int sum[10][10], num[10][10];
inline int getsum(int x1, int y1, int x2, int y2) {
	return sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1];
}
int solve(int n, int x1, int y1, int x2, int y2) {
	if (dp[n][x1][y1][x2][y2]) //记忆化搜索
		return dp[n][x1][y1][x2][y2];
	else if (n == 1)
		return getsum(x1, y1, x2, y2)*getsum(x1, y1, x2, y2);
	int minn = INF;
	for (int i = x1; i < x2; i++) { //竖着切
		int lef_siz = getsum(x1, y1, i, y2);
		int rig_siz = getsum(i + 1, y1, x2, y2);
		minn = min(minn, min(solve(n - 1, x1, y1, i, y2) + rig_siz * rig_siz,
			solve(n - 1, i + 1, y1, x2, y2) + lef_siz * lef_siz));
	}
	for (int i = y1; i < y2; i++) {//横着切
		int top_siz = getsum(x1, y1, x2, i);
		int down_siz = getsum(x1, i + 1, x2, y2);
		minn = min(minn, min(solve(n - 1, x1, y1, x2, i) + down_siz * down_siz,
			solve(n - 1, x1, i + 1, x2, y2) + top_siz * top_siz));
	}
	return dp[n][x1][y1][x2][y2] = minn;
}
int main() {
	int n; cin >> n;
	for (int i = 1; i <= 8; i++) {
		for (int j = 1; j <= 8; j++) {
			scanf("%d", *(num + i) + j);
		}
	}
	for (int i = 1; i <= 8; i++) {
		for (int j = 1; j <= 8; j++) {
			sum[i][j] = num[i][j] + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
		}
	}
	double res = (double)solve(n, 1, 1, 8, 8);
	res /= (double)n;
	res -= ((double)sum[8][8] / n)*((double)sum[8][8] / n);
	printf("%.3lf\n", sqrt(res));
	return 0;
}

 

二维区间dp递推写法：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
using namespace std;
const int INF = 0x3f3f3f3f;
int dp[18][10][10][10][10];
//sum : 二位前缀和
int sum[10][10], num[10][10];
inline int getsum(int x1, int y1, int x2, int y2) {
	return sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1];
}
int main() {
	int n; cin >> n;
	for (int i = 1; i <= 8; i++) {
		for (int j = 1; j <= 8; j++) {
			scanf("%d", *(num + i) + j);
		}
	}
	for (int i = 1; i <= 8; i++) {
		for (int j = 1; j <= 8; j++) {
			sum[i][j] = num[i][j] + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
		}
	}
	//memset(dp, INF, sizeof(dp));
	for (int x1 = 1; x1 <= 8; x1++) {
		for (int y1 = 1; y1 <= 8; y1++) {
			for (int x2 = x1; x2 <= 8; x2++) {
				for (int y2 = y1; y2 <= 8; y2++) {
					dp[0][x1][y1][x2][y2] = getsum(x1, y1, x2, y2)*getsum(x1, y1, x2, y2);
				}
			}
		}
	}

	for (int i = 1; i < n; i++) {
		for (int x1 = 1; x1 <= 8; x1++) {
			for (int y1 = 1; y1 <= 8; y1++) {
				for (int x2 = x1; x2 <= 8; x2++) {
					for (int y2 = y1; y2 <= 8; y2++) {
						int &obj = dp[i][x1][y1][x2][y2];
						obj = INF; //????
						for (int div = x1; div < x2; div++) {
							int lef_siz = getsum(x1, y1, div, y2);
							int rig_siz = getsum(div + 1, y1, x2, y2);
							obj = min(obj, min(dp[i - 1][x1][y1][div][y2] + rig_siz * rig_siz,
								dp[i - 1][div + 1][y1][x2][y2] + lef_siz * lef_siz));
						}
						for (int div = y1; div < y2; div++) {
							int top_siz = getsum(x1, y1, x2, div);
							int down_siz = getsum(x1, div + 1, x2, y2);
							obj = min(obj, min(dp[i - 1][x1][y1][x2][div] + down_siz * down_siz,
								dp[i - 1][x1][div + 1][x2][y2] + top_siz * top_siz));
						}
					}
				}
			}
		}
	}
	double res = (double)dp[n-1][1][1][8][8];
	res /= (double)n;
	res -= ((double)sum[8][8] / n)*((double)sum[8][8] / n);
	printf("%.3lf\n", sqrt(res));
	return 0;
}