POJ1191-裸动态规划
2012-07-21 16:34
120 查看
#include <cstdio> #include <iostream> #include <cmath> using namespace std; const double INF=1000000000000.0; int n; double _x,w; double s[9][9]; double f[9][9][9][9][16]; int main() { scanf("%d",&n); for (int i=0; i<=8; i++) s[i][0]=s[0][i]=0; for (int i=1; i<=8; i++) for (int j=1; j<=8; j++) { scanf("%lf",&w); s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+w; } _x=s[8][8]/n; 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++) { w=s[x2][y2]-s[x1-1][y2]-s[x2][y1-1]+s[x1-1][y1-1]-_x; f[x1][y1][x2][y2][1]=w*w; for (int i=2; i<=n; i++) f[x1][y1][x2][y2][i]=INF; } for (int i=2; i<=n; i++) 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++) { for (int k=x1; k<x2; k++) { if (f[x1][y1][x2][y2][i]>f[x1][y1][k][y2][i-1]+f[k+1][y1][x2][y2][1]) f[x1][y1][x2][y2][i]=f[x1][y1][k][y2][i-1]+f[k+1][y1][x2][y2][1]; if (f[x1][y1][x2][y2][i]>f[x1][y1][k][y2][1]+f[k+1][y1][x2][y2][i-1]) f[x1][y1][x2][y2][i]=f[x1][y1][k][y2][1]+f[k+1][y1][x2][y2][i-1]; } for (int k=y1; k<y2; k++) { if (f[x1][y1][x2][y2][i]>f[x1][y1][x2][k][i-1]+f[x1][k+1][x2][y2][1]) f[x1][y1][x2][y2][i]=f[x1][y1][x2][k][i-1]+f[x1][k+1][x2][y2][1]; if (f[x1][y1][x2][y2][i]>f[x1][y1][x2][k][1]+f[x1][k+1][x2][y2][i-1]) f[x1][y1][x2][y2][i]=f[x1][y1][x2][k][1]+f[x1][k+1][x2][y2][i-1]; } } printf("%.3f\n",sqrt(f[1][1][8][8] /n)); return 0; }
相关文章推荐
- poj 1191 棋盘分割 动态规划
- POJ-1191 棋盘分割 动态规划
- 【递归 & 动态规划】POJ 1191 棋盘分割
- 【动态规划+递归】:poj1191,棋盘分割
- poj 1191 棋盘分割 动态规划
- 棋盘分割 动态规划 poj 1191
- POJ-1191-棋盘分割(动态规划)
- POJ-1191-棋盘分割(动态规划)
- poj 动态规划DP - 2392 Space Elevator
- POJ 1458/HDU 1159 最长公共子序列 (动态规划)
- OpenJudge百炼-1191-棋盘分割-C语言-动态规划
- poj 1651 Multiplication Puzzle -- (动态规划,区间dp)
- poj 3176(简单动态规划)
- poj1191(记忆化搜索)
- poj 1050动态规划+最大子矩阵和+二维化为一维来求最大子串和值
- POJ 2385 Apple Catching 动态规划
- poj 1050 To the Max(动态规划处理二维最大子段和)
- 动态规划入门(三)DP 基本思想 具体实现 经典题目 POJ1159 POJ1458 POJ1141
- poj-1191-棋盘分割
- POJ-1189 钉子和小球(动态规划)