poj1191

sum[x1][y1][x2][y2]表示由(x1,y1),(x2,y2)两点构成的矩形的平方和，

ans[k][x1][y1][x2][y2]表示切割k-1次后得到的k个矩形，

状态转移方程ans[k][x1][y1][x2][y2]=min{

min{makeans(k-1,x1,y1,i,y2)+makesum(i+1,y1,x2,y2) , makeans(k-1,i+1,y1,x2,y2)+makesum(x1,y1,i,y2)} , (x1<=i<x2)

min{makeans(k-1,x1,y1,x2,j)+makesum(x1,j+1,x2,y2) , makeans(k-1,x1,j+1,x2,y2)+makesum(x1,y1,x2,j)},(y1<=i<y2)

}

为了避免重复计算，记忆化保存之前计算过的数据。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include <iostream>
#include<string>
#include <queue>
#include <stack>
#include <vector>
#define MAXN 100005
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
int n;
int map[9][9];
int sum[9][9][9][9];
int ans[16][9][9][9][9];
using namespace std;




int makesum(int x1,int y1,int x2,int y2)
{
    if(sum[x1][y1][x2][y2]>0) return sum[x1][y1][x2][y2];
    for(int i=x1; i<=x2; i++)
        for(int j=y1; j<=y2; j++)
            sum[x1][y1][x2][y2]+=map[i][j];
    sum[x1][y1][x2][y2] = sum[x1][y1][x2][y2] * sum[x1][y1][x2][y2];
    return sum[x1][y1][x2][y2];
}




int makeans(int k,int x1,int y1,int x2,int y2)
{
    if(k==1)//不需要再往下分
    {
        if(ans[k][x1][y1][x2][y2]==-1)//未计算过
        {
            ans[k][x1][y1][x2][y2]=makesum(x1,y1,x2,y2);
        }

        return ans[k][x1][y1][x2][y2];
    }


    if(ans[k][x1][y1][x2][y2]!=-1)//已有计算
    {
        return ans[k][x1][y1][x2][y2];
    }





    int min = 9999999;
    for(int i=x1; i<x2; i++) //横向切割
    {
        int m=makeans(k-1,x1,y1,i,y2)+makesum(i+1,y1,x2,y2);
        if(min>m)min=m;
        m=makeans(k-1,i+1,y1,x2,y2)+makesum(x1,y1,i,y2);
        if(min>m)min=m;
    }
    for(int j=y1; j<y2; j++)//纵向切割
    {
        int m=makeans(k-1,x1,y1,x2,j)+makesum(x1,j+1,x2,y2);
        if(min>m)min=m;
        m=makeans(k-1,x1,j+1,x2,y2)+makesum(x1,y1,x2,j);
        if(min>m)min=m;
    }
    ans[k][x1][y1][x2][y2]=min;
    return min;
}
int main()
{
    double summ = 0.0;
    scanf("%d",&n);
    for(int i=1; i<=8; i++)
        for(int j=1; j<=8; j++)
        {
            scanf("%d",&map[i][j]);
            summ+=map[i][j];
        }
    summ/=n;
    memset(sum,0,sizeof(sum));
    memset(ans,-1,sizeof(ans));
    double anss = makeans(n,1,1,8,8);
    anss=sqrt(anss/n-summ*summ);
    printf("%.3lf\n",anss);
    return 0;
}