POJ1191 棋盘分割

//============================================================================
// Name        : 16.cpp
// Author      : wly
// Version     :
// Copyright   : 棋盘分割
// Description : 尼玛5维的dp....
//		刘汝佳黑书116页
//		将求方差最小转化成每个矩形的分值的平方和最小
//		预先处理8*8矩阵从[0,0]到[i,j]的子矩阵的和，存在sum[i][j]中
//		利用dp[k][x1][y1][x2][y2]存从[x1,y1]到[x2,y2]子矩阵分成k块的最小结果，
//		显然dp[n][1][1][n][n]即为最终结果
//		dp方程:
//		dp[k][x1][y1][x2][y2] = min{
//			min(dp[1][a+1][y1][x2][y2]+dp[k-1][x1][y1][a][y2],
//				//横着切,x1~a部分分为k-1份,a+1~x2部分分为1份
//				dp[k-1][a+1][y1][x2][y2]+dp[1][x1][y1][a][y2])  x1<=a<x2 ,
//				//横着切,x1~a部分分为1份,a+1~x2部分分为k-1份
//			min(dp[1][x1][b+1][x2][y2]+dp[k-1][x1][y1][x2][b],
//				//竖着切,y1~b部分分为k-1份,b+1~y2部分分为1份
//				dp[k-1][x1][b+1][x2][y2]+dp[1][x1][y1][x2][b])  y1<=b<y2
//				//竖着切,y1~b部分分为1份,b+1~y2部分分为k-1份
//		};
//============================================================================

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#define INF 999999999
using namespace std;
int main(void) {
	int n;
	scanf("%d", &n);
	double sum[9][9];
	double dp[16][9][9][9][9];
	memset(sum, 0, sizeof(sum));
	for (int i = 1; i <= 8; i++)
		for (int j = 1; j <= 8; j++) {
			double tmp;
			scanf("%lf", &tmp);
			sum[i][j] = tmp + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
		}
	double avg = sum[8][8] / n;
	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++) {
					double tmp = sum[x2][y2] - sum[x1 - 1][y2]
							- sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1] - avg;
					dp[1][x1][y1][x2][y2] = tmp * tmp;
					for (int i = 2; i <= n; i++)
						dp[i][x1][y1][x2][y2] = INF;
				}
	for (int k = 2; k <= n; k++)
		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++) {
						for (int a = x1; a < x2; a++) {
							dp[k][x1][y1][x2][y2] = min(dp[k][x1][y1][x2][y2],
									dp[k - 1][x1][y1][a][y2]
											+ dp[1][a + 1][y1][x2][y2]);
							dp[k][x1][y1][x2][y2] = min(dp[k][x1][y1][x2][y2],
									dp[1][x1][y1][a][y2]
											+ dp[k - 1][a + 1][y1][x2][y2]);
						}
						for (int b = y1; b < y2; b++) {
							dp[k][x1][y1][x2][y2] = min(dp[k][x1][y1][x2][y2],
									dp[1][x1][b + 1][x2][y2]
											+ dp[k - 1][x1][y1][x2][b]);
							dp[k][x1][y1][x2][y2] = min(dp[k][x1][y1][x2][y2],
									dp[k - 1][x1][b + 1][x2][y2]
											+ dp[1][x1][y1][x2][b]);
						}
					}
	printf("%.3f\n", sqrt(dp[n][1][1][8][8] / n));
}