先考虑单个格子
如果有某个格子的值在[k,2k]可以直接输出
如果在[2k+1,+∞),因为所有元素非负,这个格子一定不能选,把这个格子标记出来
于是最终的矩形一定全部由< k的元素组成
若这个矩形的和>2k,我们将他分割成2个矩形,不可能和都< k,所以我们不断分割一定能构造出一个合法答案
于是用单调队列什么的扫一下找出原矩阵中不含标记点的极大子矩阵,若他的和< k就无解,否则构造一下
code:
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<algorithm>
#define ll long long
using namespace std;
inline void read(int &x)
{
char c; while(!((c=getchar())>='0'&&c<='9'));
x=c-'0';
while((c=getchar())>='0'&&c<='9') (x*=10)+=c-'0';
}
const int maxn = 2100;
int n,K;
struct point{int x,y;};
struct rec{point l,r;}now; ll ans;
int a[maxn][maxn],To[maxn][maxn];
ll s[maxn][maxn];
point q[maxn]; int head,tail;
ll cal(int a1,int a2,int b1,int b2)
{
return s[b1][b2]-s[b1][a2-1]-s[a1-1][b2]+s[a1-1][a2-1];
}
int main()
{
scanf("%d%d",&K,&n);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
read(a[i][j]);
if(a[i][j]>=K&&a[i][j]<=2*K) return printf("%d %d %d %d\n",j,i,j,i),0;
}
}
for(int j=1;j<=n;j++)
{
for(int i=1;i<=n;i++)
{
To[i][j]=To[i-1][j];
if(a[i][j]>2*K) To[i][j]=i;
s[i][j]=s[i-1][j]+(ll)a[i][j];
}
for(int i=1;i<=n;i++) s[i][j]+=s[i][j-1];
}
for(int i=1;i<=n;i++)
{
head=1,tail=0;
for(int j=1;j<=n;j++)
{
point las=(point){0,0};
while(head<=tail&&q[tail].y<=To[i][j])
{
ll temp=cal(q[tail].y,q[tail].x,i,j-1);
if(temp>ans) ans=temp,now.l=q[tail],now.r=(point){j-1,i};
las=q[tail--];
}
if(a[i][j]>2*K) continue;
if(head<=tail&&q[tail].y==To[i][j]+1) continue;
if(!las.x) q[++tail]=(point){j,To[i][j]+1};
else q[++tail]=(point){las.x,To[i][j]+1};
}
while(head<=tail)
{
ll temp=cal(q[tail].y,q[tail].x,i,n);
if(temp>ans) ans=temp,now.l=q[tail],now.r=(point){n,i};
tail--;
}
}
if(ans<K) return puts("NIE"),0;
while(ans>2ll*K)
{
if(now.l.x<now.r.x)
{
ll t1=cal(now.l.y,now.l.x,now.r.y,now.l.x),t2=ans-t1;
if(t1<t2) now.l.x++,ans=t2;
else now.r.x=now.l.x,ans=t1;
}
else
{
ans-=(ll)a[now.l.y][now.l.x];
now.l.y++;
}
}
printf("%d %d %d %d\n",now.l.x,now.l.y,now.r.x,now.r.y);
return 0;
}