Div4 1676 D 矩阵对角线性质

最新推荐文章于 2024-07-15 16:33:31 发布

Satrol_

最新推荐文章于 2024-07-15 16:33:31 发布

阅读量51

点赞数

分类专栏： CF 文章标签：矩阵算法 c++

本文链接：https://blog.csdn.net/m0_71935363/article/details/134984835

版权

CF 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

D. X-Sum

Timur’s grandfather gifted him a chessboard to practice his chess skills. This chessboard is a grid $a$ with $n$ rows and $m$ columns with each cell having a non-negative integer written on it.

Timur’s challenge is to place a bishop on the board such that the sum of all cells attacked by the bishop is maximal. The bishop attacks in all directions diagonally, and there is no limit to the distance which the bishop can attack. Note that the cell on which the bishop is placed is also considered attacked. Help him find the maximal sum he can get.

Input

The first line of the input contains a single integer $t$ ( $\le t \le 1000$ ) — the number of test cases. The description of test cases follows.

The first line of each test case contains the integers $n$ and $m$ ( $\le n \le 200$ , $\leq m \leq 200$ ).

The following $n$ lines contain $m$ integers each, the $j$ -th element of the $i$ -th line $a_{ij}$ is the number written in the $j$ -th cell of the $i$ -th row $(0\leq a_{ij} \leq 10^6)$

It is guaranteed that the sum of $n\cdot m$ over all test cases does not exceed $4\cdot10^4$ .

Output

For each test case output a single integer, the maximum sum over all possible placements of the bishop.

Example

input

output

Note

For the first test case here the best sum is achieved by the bishop being in this position:

简述题意

题目要求我们在 $n * m$ 的一个矩阵中确定一个点

以该点为中心向两条对角线扩深，找到覆盖方格和的最大值

正如题目在 $(3, 3)$ 点放置棋子，对应的值为 $1 + 4 + 3 + 4 + 4 + 4$

解题思路

初始想法

$\leq 200$ 给出的矩阵很小，我们优先考虑暴力做法

我们遍历每一个点分别向四个方向构建一个双指针for循环，统计好每一个方向的值后，加上中心点

最后将ans取最大值，也就是我们的结果

简单看一下时间复杂度两层for循环 $O(n * m) = O(n ^ 2)$ ，四个方向 $O (n)$ ，总共大概 $O(n ^ 3) = 8000000$ ，应该还是可以过的

四个for循环，想想就恶心，懒得写

这里我们可以考虑矩形中对角线的性质

一条对角线对应 $i + j$ 相等
另一条对角线对应 $i - j$ 相等

开两个数组或者说开两个Map都是可以的，用来统计对角线的和

但是注意一定不要开成一个数组了，万一出现了 $i = 3, j = 1$ 和 $i = 1, j = 1$ ，

明明两个都不在一个对角线上，你却将他们算在了对角线上

~~写的时候没想，在这卡了3次，下一题E题(也是贪心)一次过，这题3次唉。。。。~~

最精彩的Code环节

AC代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
#define str string
#define all(x) begin(x),end(x)
#define pb(x) push_back(x)
const int N = 210;
int a[N][N];
map<int,int> m1,m2;
inline void solve() {
    m1.clear(),m2.clear();
    memset(a,0,sizeof(a));
    int n,m,ans = 0; cin >> n >> m;
    for(int i = 1;i <= n;i++) {
        for(int j = 1;j <= m;j++) {
            cin >> a[i][j];
        }
    }

    for(int i = 1;i <= n;i++) {
        for(int j = 1;j <= m;j++) {
            m1[i + j] += a[i][j]; m2[i - j] += a[i][j];
            
        }
    }

    for(int i = 1;i <= n;i++) {
        for(int j = 1;j <= m;j++) {
            ans = max(ans,m1[i + j] + m2[i - j] - a[i][j]);
        }
    }

    cout << ans  << endl;
    
}

int main(){
    // freopen("input.txt","r",stdin);
    int t; cin >> t;
    while(t--) solve();

    // solve();

    return 0;
}