Codeforces Beta Round 22 (Div. 2 Only) B. Bargaining Table 题解前缀和

最新推荐文章于 2024-07-19 23:11:36 发布

bbc_ouo

最新推荐文章于 2024-07-19 23:11:36 发布

阅读量891

点赞数 9

分类专栏： Codeforces题解文章标签： c++ 算法

本文链接：https://blog.csdn.net/bbc_plus/article/details/139666715

版权

Codeforces题解专栏收录该内容

37 篇文章 0 订阅

订阅专栏

Bargaining Table

题目描述

Bob wants to put a new bargaining table in his office. To do so he measured the office room thoroughly and drew its plan: Bob’s office room is a rectangular room $n \times m$ meters. Each square meter of the room is either occupied by some furniture, or free. A bargaining table is rectangular, and should be placed so, that its sides are parallel to the office walls. Bob doesn’t want to change or rearrange anything, that’s why all the squares that will be occupied by the table should be initially free. Bob wants the new table to sit as many people as possible, thus its perimeter should be maximal. Help Bob find out the maximum possible perimeter of a bargaining table for his office.

输入格式

The first line contains 2 space-separated numbers $n$ and $m$ ( $1 <= n, m <= 25$ ) — the office room dimensions. Then there follow $n$ lines with $m$ characters 0 or 1 each. 0 stands for a free square meter of the office room. 1 stands for an occupied square meter. It’s guaranteed that at least one square meter in the room is free.

输出格式

Output one number — the maximum possible perimeter of a bargaining table for Bob’s office room.

题面翻译

给定一个 $\times m$ 的矩阵，求全 $0$ 子矩阵的周长最大值。

样例 #1

样例输入 #1

样例输出 #1

样例 #2

样例输入 #2

样例输出 #2

原题

Codeforces——传送门
 洛谷——传送门

思路&代码

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
typedef long long ll;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, m;
    cin >> n >> m;
    // 存矩形图，将字符'1'和'0'转化为数字1和0存储，便于计算
    vector<vector<char>> a(n + 1, vector<char>(m + 1, 0));
    vector<vector<int>> g(n + 1, vector<int>(m + 1, 0));
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            cin >> a[i][j];
            g[i][j] = (a[i][j] == '1') ? 1 : 0;
        }
    // 求两次前缀和，先每一行求前缀和，再每一列求前缀和
    vector<vector<int>> p(n + 1, vector<int>(m + 1, 0));
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            p[i][j] = p[i][j - 1] + g[i][j];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            p[i][j] = p[i - 1][j] + p[i][j];
    // 遍历谈判桌的左上顶点和右下顶点，确定长方形区域后判断其是否空闲
    int ans = 0;
    for (int sx = 1; sx <= n; sx++)
        for (int sy = 1; sy <= m; sy++)
            for (int ex = sx; ex <= n; ex++)
                for (int ey = sy; ey <= m; ey++)
                {
                    // 两次前缀和还原为区域总和
                    int sum1 = p[ex][sy - 1] - p[sx - 1][sy - 1];
                    int sum2 = p[ex][ey] - p[sx - 1][ey];
                    if (sum2 - sum1 == 0) // 若该长方形区域空闲，用其周长更新答案
                    {
                        int C = 2 * (ex - sx + 1) + 2 * (ey - sy + 1); // 计算周长
                        ans = max(ans, C);
                    }
                }

    cout << ans << '\n';

    return 0;
}