2014 UESTC Training for Dynamic Programming F

首先将均方差公式变形为 1/n∑Xi^2 - X^2
图内数字总和一定，所以只需要让每个矩形的总分的平方和尽量小
定义状态DP[k][x][y][x1][y1]，表示切割K次后矩形左上角矩形右下角的总平方和值。边界就是K=1，最后一次切割
然后模拟切割矩形
状态转移为
dp[k,x1,y1,x2,y2] =
min{
      min{dp[k-1,x1,y1,a,y2]+S[a+1,y1,x2,y2] , dp[k-1,a+1,y1,x2,y2]+S[x1,y1,a,y2]}(x1<=a<x2),
      min{dp[k-1,x1,y1,x2,b]+S[x1,b+1,x2,y2] , dp[k-1,x1,b+1,x2,y2]+S[x1,y1,x2,b]}(y1<=b<y2)
   }

最后答案就是dp[n][0][0][7][7];

#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
	return a % b == 0 ? b : gcd(b, a % b);
}
int G[10][10];
LL dp[20][10][10][10][10];
int sum;
int N;
LL calcu[10][10][10][10];
void init()
{
    sum=0;
    memset(calcu,0,sizeof(calcu));
    for (int i=0;i<8;i++)
        for (int j=0;j<8;j++)
        {scanf("%d",&G[i][j]);sum+=G[i][j];}
    for (int x=0;x<9;x++)
        for (int y=0;y<9;y++)
          for (int x1=x;x1<9;x1++)
            for (int y1=y;y1<9;y1++)
    {
        int tmp=0;
        for (int i=x;i<=x1;i++)
            for (int j=y;j<=y1;j++)
            tmp+=G[i][j];
        calcu[x][y][x1][y1]=tmp*tmp;
        calcu[x1][y][x][y1]=tmp*tmp;
        calcu[x][y1][x1][y]=tmp*tmp;
        calcu[x1][y1][x][y]=tmp*tmp;
    }
}
LL DP(int k,int x,int y,int x1,int y1)
{
    LL &ans=dp[k][x][y][x1][y1];
    if (ans!=-1) return ans;
    if (k==1) return calcu[x][y][x1][y1];
    LL tmp=0;
    ans=1e12;
    for (int i=x;i<x1;i++)
    {
        tmp=min(DP(k-1,x,y,i,y1)+calcu[i+1][y][x1][y1],DP(k-1,i+1,y,x1,y1)+calcu[x][y][i][y1]);
        ans=min(ans,tmp);
    }
    for (int i=y;i<y1;i++)
    {
        tmp=min(DP(k-1,x,y,x1,i)+calcu[x][i+1][x1][y1],DP(k-1,x,i+1,x1,y1)+calcu[x][y][x1][i]);
        ans=min(ans,tmp);
    }
    return ans;
}
int main()
{
    //freopen("sample.txt","r",stdin);
    while (scanf("%d",&N)!=EOF)
    {
        init();
        memset(dp,-1,sizeof(dp));
        //printf("%d\n",sum);
        //printf("%lld\n",DP(N,0,0,7,7));
        double ans=sqrt(DP(N,0,0,7,7)*1.0/N-((sum*1.0)/N*(sum*1.0)/N));
        printf("%.3f\n",ans);
    }
    return 0;
}