注意到k比较小,考虑用优先队列挨个算出前k小的
得到第i小的之后向下和向右分别扩展一行一列即可
不需要向上向右,因为向这两个方向扩展后的状态可以由一个比其的优的状态的向下或者向右扩展得到
不过有两个鬼畜的地方……
首先就是重载运算符里写?:多套几层就慢爆了……比if else慢了好几倍
然后判重的时候在出优先队列的时候判(就是像dijkstra那样)比在入队列的时候判(就是像bfs那样)要好很多
#include<iostream>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<bitset>
#include<set>
#include<stack>
#include<vector>
#include<queue>
using namespace std;
#define MAXN 1025
#define MAXM 1010
#define ll long long
#define eps 1e-8
#define MOD 1000000007
#define INF 1000000000
char xB[1<<15],*xS=xB,*xTT=xB;
#define getc() (xS==xTT&&(xTT=(xS=xB)+fread(xB,1,1<<15,stdin),xS==xTT)?0:*xS++)
#define isd(c) (c>='0'&&c<='9')
int read(){
char xchh;
int xaa;
while(xchh=getc(),!isd(xchh));(xaa=xchh-'0');
while(xchh=getc(),isd(xchh))xaa=xaa*10+xchh-'0';return xaa;
}
struct area{
int lx;
int ly;
int rx;
int ry;
int v;
area(){
}
area(int _lx,int _ly,int _rx,int _ry);
};
bool operator <(area x,area y){
if(x.v!=y.v){
return x.v>y.v;
}
if(x.lx!=y.lx){
return x.lx>y.lx;
}
if(x.ly!=y.ly){
return x.ly>y.ly;
}
if(x.rx!=y.rx){
return x.rx>y.rx;
}
return x.ry>y.ry;
}
int a[MAXN][MAXN];
int s[MAXN][MAXN];
int n,m,k;
int mx,my;
priority_queue<area>q;
int ans;
map<area,bool>h;
area::area(int _lx,int _ly,int _rx,int _ry){
lx=_lx;
ly=_ly;
rx=_rx;
ry=_ry;
v=s[rx][ry]-s[lx-1][ry]-s[rx][ly-1]+s[lx-1][ly-1];
}
int main(){
int i,j;
n=read();
m=read();
mx=read();
my=read();
k=read();
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
a[i][j]=read();
s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
if(i>=mx&&j>=my){
q.push(area(i-mx+1,j-my+1,i,j));
}
}
}
while(k--){
area x=q.top();
q.pop();
if(h[x]){
k++;
continue ;
}
h[x]=1;
ans=x.v;
if(x.rx+1<=n){
q.push(area(x.lx,x.ly,x.rx+1,x.ry));
}
if(x.ry+1<=m){
q.push(area(x.lx,x.ly,x.rx,x.ry+1));
}
}
printf("%d\n",ans+1);
return 0;
}
/*
*/