POJ 1191 棋盘分割

题目点我
经典的动态规划题目，首先将标准差公式变形一下：

$$\sigma = \sqrt{\frac{\sum_{i=1}^n(x_i - \bar x)^2}{n}}\,\Rightarrow\,n(\sigma^2+\bar x^2) = \sum_{i=1}^nx_i^2$$
由于 $\bar x$是固定的，与分割方案无关，所以求最小的标准差就相当于求最小的平方和的分割方案。定义状态需要五个维度：描述一个矩形需要四个维度（左上角坐标 $x_1,y_1$和右下角坐标 $x_2,y_2$）+要分割的块数 $n$
$$dp[x_1][y_1][x_2][y_2][n] = \sum_{i=1}^nx_i^2$$
状态转移方程如下，其中 $s[x_1][y_1][x_2][y_2]$表示这块棋盘 权值之和的平方
$$dp[x_1][y_1][x_2][y_2][n] =min\{ \\min\{dp[x_1][y_1][x_2][hori][n-1]+s[x_1][hori+1][x_2][y_2]\,,\\ s[x_1][y_1][x_2][hori]+dp[x_1][hori+1][x_2][y_2][n-1]\}\;(y_1\le hori\lt y_2), \\min\{dp[x_1][y_1][vert][y_2][n-1]+s[vert+1][y_1][x_2][y_2]\,,\\ s[x_1][y_1][vert][y_2]+dp[vert+1][y_1][x_2][y_2][n-1]\}\;(x_1\le vert\lt x_2)\}$$

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

#define INF 100000000 

int ans[10][10][10][10][17];
bool vis[10][10][10][10][17];
int matrix[10][10];

int min(int a, int b){
    return a > b ? b : a;
}

int sum(int x1, int y1, int x2, int y2){
    // from 0 to 7
    if(vis[x1][y1][x2][y2][1])
        return ans[x1][y1][x2][y2][1];
    int sum = 0;
    for(int x = x1; x <= x2; x++){
        for(int y = y1; y <= y2; y++){
            sum += matrix[x][y];
        }
    }
    sum = sum * sum;
    ans[x1][y1][x2][y2][1] = sum;
    vis[x1][y1][x2][y2][1] = true;
    return sum;
}

int dp(int x1, int y1, int x2, int y2, int n){
    if(vis[x1][y1][x2][y2][n])
        return ans[x1][y1][x2][y2][n];
    if(n == 1)
        return sum(x1, y1, x2, y2);
    int tmpdp = INF, hori, vert;
    for(hori = y1; hori < y2; hori++){
        tmpdp = min(tmpdp, 
            min(dp(x1, y1, x2, hori, n-1) + sum(x1, hori+1, x2, y2), 
            sum(x1, y1, x2, hori) + dp(x1, hori+1, x2, y2, n-1)));
    }
    for(vert = x1; vert < x2; vert++){
        tmpdp = min(tmpdp,
            min(dp(x1, y1, vert, y2, n-1) + sum(vert+1, y1, x2, y2),
            sum(x1, y1, vert, y2) + dp(vert+1, y1, x2, y2, n-1)));  
    }
    ans[x1][y1][x2][y2][n] = tmpdp;
    vis[x1][y1][x2][y2][n] = true;
    return tmpdp;
}

int main(){
    int n;
    long double xbar = 0;
    memset(ans, 0, sizeof(int) * 170000);
    memset(vis, 0, sizeof(bool) * 170000);
    memset(matrix, 0, sizeof(int) * 100);
    scanf("%d", &n);
    for(int x = 0; x < 8; x++){
        for(int y = 0; y < 8; y++){
            scanf("%d", &matrix[x][y]);
            xbar += matrix[x][y];
        }
    }
    xbar = xbar / n;
    long double tmp = dp(0, 0, 7, 7, n);
    tmp = sqrt((tmp / n) - xbar * xbar);
    printf("%.3f\n", tmp);
    return 0;
}