acwing 321 棋盘分割

最新推荐文章于 2024-03-03 18:15:29 发布

(xsj)

最新推荐文章于 2024-03-03 18:15:29 发布

阅读量112

点赞数

分类专栏： DP 文章标签：区间DP 记忆化搜索

本文链接：https://blog.csdn.net/qq_44791484/article/details/115530322

版权

DP 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

题面

在这里插入图片描述

题解(记忆化搜索)

在这里插入图片描述

代码

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>

using namespace std;
const int N = 9, M = 15;
const int INF = 1e9;

int n, m = 8;
int s[N][N];  //二维前缀和
double f[N][N][N][N][M];
double X;  //平均值

//留下部分的值
double get(int x1, int y1, int x2, int y2) {
    double sum = s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1] - X;
    return (double) sum * sum / n;
}

//记忆化搜索
double dp(int x1, int y1, int x2, int y2, int k) {
    double &v = f[x1][y1][x2][y2][k];
    if (v >= 0) return v;  //说明已经计算过
    if (k == 1) return v = get(x1, y1, x2, y2); //不再分割的值
    v = INF;
    for (int i = x1; i < x2; i++) {  //横向切割
        v = min(v, dp(x1, y1, i, y2, k - 1) + get(i + 1, y1, x2, y2));  //取上继续切计算下边
        v = min(v, dp(i + 1, y1, x2, y2, k - 1) + get(x1, y1, i, y2)); //取下继续切计算上边
    }

    for (int i = y1; i < y2; i++) {  //纵向切割
        v = min(v, dp(x1, y1, x2, i, k - 1) + get(x1, i + 1, x2, y2)); //取左继续切计算右边
        v = min(v, dp(x1, i + 1, x2, y2, k - 1) + get(x1, y1, x2, i));//取右继续切计算左边
    }
    return v;
}


int main() {

    cin >> n;
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> s[i][j];
            s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
        }
    }

    X = (double) s[m][m] / n;
    memset(f, -1, sizeof f);
    printf("%.3lf\n", sqrt(dp(1, 1, m, m, n)));

    return 0;
}