经典问题六.【二维的区间dp】棋盘分割 poj 1191

问题描述：
将一个８*８的棋盘进行如下分割：将原棋盘割下一块矩形棋盘并使剩下部分也是矩形，再将剩下的部分继续如此分割，这样割了(n-1)次后，连同最后剩下的矩形棋盘共有n块矩形棋盘。(每次切割都只能沿着棋盘格子的边进行)

思路：
dp[i][x1][y1][x2][y2] 代表从（x1，y1）到（x2，y2）的矩形划分成i块的最优平方和
递推分四种情况：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 10;

int p[N][N];
int dp[16][N][N][N][N];
int main()
{
    int n;
    scanf("%d",&n);
    int sum = 0;
    for(int i = 1; i <= 8; i++)
    {
        for(int j = 1; j <= 8; j++)
        {
            scanf("%d",&p[i][j]);
            sum += p[i][j];
            p[i][j] *= n;
        }
    }
    memset(dp,0,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++)
                {
                    int temp = 0;
                    for(int i = x1; i <= x2; i++)
                        for(int j = y1; j <= y2; j++)
                            temp += p[i][j];
                    dp[1][x1][y1][x2][y2] = (temp-sum)*(temp-sum);
                }
            }
        }
    }
    for(int ci = 2; ci <= n; ci++)
    {
        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++)
                    {
                        if(x2+y2-x1-y1 < ci-1) continue;
                        int minn = INF;
                        for(int i = x1; i < x2; i++)
                        {
                            if(i+y2-x1-y1 >= ci-2)
                                minn = min(minn,dp[ci-1][x1][y1][i][y2]+dp[1][i+1][y1][x2][y2]);
                            if(x2+y2-(i+1)-y1 >= ci-2)
                                minn = min(minn,dp[1][x1][y1][i][y2]+dp[ci-1][i+1][y1][x2][y2]);
                        }
                        for(int i = y1; i < y2; i++)
                        {
                            if(x2+i-x1-y1 >= ci-2)
                                minn = min(minn,dp[ci-1][x1][y1][x2][i]+dp[1][x1][i+1][x2][y2]);
                            if(x2+y2-(i+1)-x1 >= ci-2)
                                minn = min(minn,dp[1][x1][y1][x2][i]+dp[ci-1][x1][i+1][x2][y2]);
                        }
                        dp[ci][x1][y1][x2][y2] = minn;
                    }
                }
            }
        }
    }
    int ans = dp[n][1][1][8][8];
    double x = sqrt(ans*1.0)/(n*sqrt(n*1.0));
    printf("%.3f\n",x);
    return 0;
}