矩阵前缀和：找到窗口的*最多数量

liuhuangdi

已于 2024-12-21 13:40:19 修改

阅读量385

点赞数 10

CC 4.0 BY-SA版权

分类专栏：算法7 文章标签：矩阵线性代数 C++

于 2024-06-05 14:38:54 首次发布

本文链接：https://blog.youkuaiyun.com/jsjsbsb464548/article/details/139471966

#include<iostream>
#include <vector>
#include<algorithm>
#include<cmath>
#include <climits>
#include<unordered_map>
using namespace std;
typedef long long ll;
#define ret return
#define str string
#define vt vector
#define vti vector<int>
#define forc(s,e) for(int i=s;i<e;i++)
#define fori(i,s,e) for(int i=s;i<e;i++)
#define umap unordered_map
#define vmp(vec, map) do { for (size_t i = 0; i < vec.size(); ++i) { (map)[vec[i]] = i; }} while(0)
#define smp(container, map)for (const auto& item : container) {(map)[item]++;}
#define fora(v) for(auto a:v)
template<typename T>
using vvt = vector<vector<T>>;
#define foreach2(container) for(auto& row : container){ for(auto element : row) if(true) std::cout << element << " "; std::cout << std::endl;}
const ll N=1e16;

void solve(){
    int n,m;cin>>n>>m;
    vvt<char> v(n,vt<char>(n));
    fori(i,0,n){
        fori(j,0,n){