poj棋盘分割（记忆化）

http://poj.org/problem?id=1191

黑书上P116 想了挺久 没想出来 想推出一公式来着 退不出来。。

想偏了  正解：递归

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<stdlib.h>
 #include<algorithm>
 #include<cmath>
 using namespace std;
 #define INF 0xfffffff
 #define LL long long
 int dp[][][][][];
 int aa[][],n;
 int divide(int k,int a,int b,int c,int d)
 {
     int i,j,minz = INF,g;
     if(dp[k][a][b][c][d])
     return dp[k][a][b][c][d];
     if(k==n)
     {
         int s = ;
         for(i = a; i <= c ; i++)
             for(j = b ; j <= d ; j++)
             s+=aa[i][j];
         dp[k][a][b][c][d] = s*s;
         return s*s;
     }
     for(i = a+ ; i <= c ; i++)
     {
         int s = ;
         for(g = i ; g <= c ; g++)
         for(j = b ; j <= d ; j++)
         s+=aa[g][j];
         minz = min(minz,s*s+divide(k+,a,b,i-,d));
         s = ;
         for(g = a ; g <= i- ; g++)
         for(j = b ; j <= d ; j++)
         s+=aa[g][j];
         minz = min(minz,s*s+divide(k+,i,b,c,d));
     }
     for(i = b+ ; i <= d ; i++)
     {
         int s = ;
         for(g = a ; g <= c ; g++)
         for(j = i ; j <= d ; j++)
         s+=aa[g][j];
         minz = min(minz,s*s+divide(k+,a,b,c,i-));
         s = ;
         for(g = a ; g <= c ; g++)
         for(j = b ; j <= i- ; j++)
         s+=aa[g][j];
         minz = min(minz,s*s+divide(k+,a,i,c,d));
     }
     dp[k][a][b][c][d] = minz;
     return minz;
 }
 int main()
 {
     int i,j;
     while(scanf("%d",&n)!=EOF)
     {
         double s=;
         memset(dp,,sizeof(dp));
         int m = ;
         n--;
         for(i = ; i <= m ;i++)
             for(j = ; j <= m ; j++)
             {
                 scanf("%d",&aa[i][j]);
                 s+=double(aa[i][j]);
             }
         s = s/double(n+);
         int ans = divide(,,,m,m);
         double an = 1.0/double(n+)*double(ans)-s*s;
         printf("%.3lf\n",sqrt(an));
     }
     return ;
 }

下面那个不是 贴错了

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<stdlib.h>
 #define N 5010
 #define M 3010
 #define INF 0xfffffff
 using namespace std;
 int dp[M][N],h[N];
 int main()
 {
     int i,j,n,m,g;
     scanf("%d%d",&m,&n);
     for(i = ; i <= n ;i++)
     scanf("%d",&h[i]);
     for(i = ; i <= m ;i++)
         for(j = ; j <= n ;j++)
         dp[i][j] = INF;
     int o = INF;
     for(i =  ; i < n ;i++)
     {
         dp[][i] = min(o,(h[i]-h[i-])*(h[i]-h[i-]));
         o = min(dp[][i],o);
     }
     for(i =  ; i <= m ; i++)
     {
         int o = INF;
         for(j = *i ; j < n-(m-i)* ;j++)
         {
             if(j-<(n-(m-i+)*))
             dp[i][j] = min(o,dp[i-][j-]+(h[j]-h[j-])*(h[j]-h[j-]));
             else
             dp[i][j] = min(o,dp[i-][j-]+(h[j]-h[j-])*(h[j]-h[j-]));
             o = min(o,dp[i][j]);
         }
     }
     printf("%d\n",dp[m][n-]);
     return ;
 }