对于这个矩阵如果其中某一个元素满足要求直接输出即可…否则就把大于2k的点都视为不可选择的点…找出所有的极大子矩阵…如果存在一个极大子矩阵符合要求就直接输出…否则就寻找大于2k的极大子矩阵然后递归寻找答案…
代码如下:
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
//by NeighThorn
#define LL long long
using namespace std;
const int maxn=2000+5;
int n,k,l[maxn][maxn],r[maxn][maxn],h[maxn][maxn];
LL sum[maxn][maxn],a[maxn][maxn];
inline LL calc(int x1,int y1,int x2,int y2){
return sum[x2][y2]-sum[x2][y1-1]-sum[x1-1][y2]+sum[x1-1][y1-1];
}
inline void print(int x1,int y1,int x2,int y2){
while(calc(x1,y1,x2,y2)>2*k){
if(x1==x2)
y2--;
else if(calc(x1+1,y1,x2,y2)>=k)
x1++;
else
x2--;
}
printf("%d %d %d %d\n",y1,x1,y2,x2);exit(0);
}
signed main(void){
scanf("%d%d",&k,&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
scanf("%lld",&a[i][j]);
if(a[i][j]>=k&&a[i][j]<=2*k){
printf("%d %d %d %d\n",j,i,j,i);
return 0;
}
sum[i][j]=sum[i][j-1]+sum[i-1][j]-sum[i-1][j-1]+a[i][j];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(a[i][j]>2*k)
l[i][j]=0;
else
l[i][j]=l[i][j-1]+1;
}
for(int j=n;j>=1;j--){
if(a[i][j]>2*k)
r[i][j]=0;
else
r[i][j]=r[i][j+1]+1;
}
}
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=1&&a[i][j]<=2*k&&a[i-1][j]<=2*k)
h[i][j]=h[i-1][j]+1,l[i][j]=min(l[i-1][j],l[i][j]),r[i][j]=min(r[i-1][j],r[i][j]);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][j]<=2*k){
int tmp=calc(i-h[i][j],j-l[i][j]+1,i,j+r[i][j]-1);
if(tmp>=k)
print(i-h[i][j],j-l[i][j]+1,i,j+r[i][j]-1);
}
puts("NIE");
return 0;
}
by >_< NeighThorn