POJ 1191

一道很简单的动态规划题目，

dp过程，dp[k][lx][ly][rx][ry] = Min{Min{dp[k-1][i+1][ly][rx][ry],dp[k-1][lx][ly][i][ry]},Min{dp[k-1][lx][i+1][rx][ry],dp[k-1][lx][ky][rx][i]}};

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define M 9
const int inf = 0x13131313;
int n;
int Map[M][M]={0};
int S[M][M]={0};
int f[16][M][M][M][M] = {0};
int Min(int a,int b){return a<b?a:b;}
int dp(int k,int lx,int ly,int rx,int ry)
{
	int temp ;
	if(f[k][lx][ly][rx][ry] != 0) return f[k][lx][ly][rx][ry];
	if(k == 1)
	{
		temp = S[rx][ry] + S[lx - 1][ly - 1] - S[lx - 1][ry] - S[rx][ly - 1];  
		return temp * temp;
	}
	int cost = inf;
	for(int i = lx; i < rx; i ++)
	{
		temp = S[i][ry] + S[lx - 1][ly - 1] - S[lx - 1][ry] - S[i][ly - 1]; 
		cost = Min(cost,dp(k-1,i+1,ly,rx,ry)+temp*temp);
		temp = S[rx][ry] + S[i][ly-1] - S[rx][ly-1] - S[i][ry];
		cost = Min(cost,dp(k-1,lx,ly,i,ry)+temp*temp);
		
	}
	for(int i = ly; i < ry; i ++)
	{
		temp = S[rx][i] + S[lx - 1][ly - 1] - S[lx -1][i] - S[rx][ly - 1];
		cost = Min(cost,dp(k-1,lx,i+1,rx,ry)+temp*temp);
		temp = S[rx][ry] + S[lx - 1][i] - S[lx - 1][ry] - S[rx][i];
		cost = Min(cost,dp(k-1,lx,ly,rx,i)+temp*temp);
	}
	f[k][lx][ly][rx][ry] = cost;
	return cost;
}
int main()
{
	int i,j,sum = 0;
	double average ;
	scanf("%d",&n);
	for(i = 1; i <= 8; i ++)
	{
		for(j = 1; j <= 8 ; j ++)
		{
			scanf("%d",&Map[i][j]);
			sum += Map[i][j];
			S[i][j] = S[i-1][j] + S[i][j-1] - S[i-1][j-1] + Map[i][j];
		}
	}
	average = (double)sum / (n);
	average = average * average * n;
	double ans = dp(n,1,1,8,8) - average;
	printf("%.3f\n",sqrt(ans/n));
	return 0;
}