BZOJ 4165 矩阵 堆

先把每个长为$mina$,宽为$minb$的矩阵扔到堆里，然后由于矩阵中的数都是正的，所以我们每取出来一个矩形，，就把他向四个方向扩张一行，再把这新的且更大的四个矩形扔到堆里。注意判重，于是我比较懒用的$map$ $qwq$

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cctype>
#include<cstdlib>
#include<vector>
#include<queue>
#include<map>
#include<set>
#define ull unsigned long long
#define ll long long
#define R register int
using namespace std;
namespace Fread {
    static char B[<<],*S=B,*D=B;
    #define getchar() (S==D&&(D=(S=B)+fread(B,1,1<<15,stdin),S==D)?EOF:*S++)
    inline int g() {
        R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;
        do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;
    } inline bool isempty(const char& ch) {return ch<=||ch>=;}
    inline void gs(char* s) {register char ch; while(isempty(ch=getchar())); do *s++=ch; while(!isempty(ch=getchar()));}
}using Fread::g; using Fread::gs;
struct node {
    int x1,y1,x2,y2; ll W; node() {} node(int xx,int yy,int xxx,int yyy,ll w) {x1=xx,y1=yy,x2=xxx,y2=yyy,W=w;}
    inline bool operator < (const node& that) const {return W>that.W;}
}; priority_queue<node> q;
map<unsigned long long,bool> v;
inline ull hsh(int x1,int y1,int x2,int y2) {return x1+y1*+x2*1000001ull+y2*1000000001ull;}
const int dx1[]={,,,-},dx2[]={,,,},dy1[]={-,,,},dy2[]={,,,};
int n,m,a,b,k; int w[][]; ll sum[][];
inline bool ck(int x1,int y1,int x2,int y2) { return x1<||x1>n||x2<||x2>n||y1<||y1>m||y2<||y2>m;}
signed main() {
#ifdef JACK
    freopen("NOIPAK++.in","r",stdin);
#endif
    n=g(),m=g(),a=g(),b=g(),k=g();
    for(R i=;i<=n;++i) for(R j=;j<=m;++j) w[i][j]=g();
    for(R i=;i<=n;++i) for(R j=;j<=m;++j) sum[i][j]=sum[i][j-]+sum[i-][j]-sum[i-][j-]+w[i][j];
    for(R i=a;i<=n;++i) for(R j=b;j<=m;++j)
        q.push(node(i-a+,j-b+,i,j,(ll)sum[i][j]-sum[i-a][j]-sum[i][j-b]+sum[i-a][j-b])),v[hsh(i-a+,j-b+,i,j)]=true;
    for(R i=;i<k;++i) { register node tmp=q.top(); q.pop(); R x1=tmp.x1,x2=tmp.x2,y1=tmp.y1,y2=tmp.y2;
        for(R i=;i<=;++i) { R X1=x1+dx1[i],Y1=y1+dy1[i],X2=x2+dx2[i],Y2=y2+dy2[i]; if(ck(X1,Y1,X2,Y2)) continue;
        register ull H=hsh(X1,Y1,X2,Y2);
            if(v.find(H)==v.end()) q.push(node(X1,Y1,X2,Y2,sum[X2][Y2]-sum[X2][Y1-]-sum[X1-][Y2]+sum[X1-][Y1-])),v[H]=true;
        }
    } printf("%lld\n",q.top().W);
}

---

2019.06.13