Problem Description
现在有一个n*m的矩阵A,在A中找一个H*H的正方形,使得其面积最大且该正方形元素的和不大于 limit。
Input
第一行一个整数T,表示有T组数据。
每组数据 第一行三个非负整数 n m limit
接着 n 行,每行 m 个整数。
0 < n <= 1000, 0 < m <= 1000, 0 <= limit <=100000000 0 <= A[i] <= 1000
Output
对于每组数据,输出H*H。
Sample Input
22 2 21 11 12 2 41 11 1
Sample Output
14
记录矩阵的总值,然后枚举正方形的宽就行了
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 1005;
int n,m,limit;
int data[MAXN][MAXN],ans;
int get_sum(int x1,int y1,int x2,int y2){
return data[x1][y1]-data[x1][y2]+data[x2][y2]-data[x2][y1];
}
int check(int k){
for (int i = 0; i + k <= n; i++)
for (int j = 0; j + k <= m; j++)
if (get_sum(i+k,j+k,i,j) <= limit)
return true;
return false;
}
int main(){
int t;
scanf("%d",&t);
for (int i = 0; i < MAXN; i++)
data[i][0] = data[0][i] = 0;
while (t--){
scanf("%d%d%d",&n,&m,&limit);
ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
scanf("%d",&data[i][j]);
for (int i = 1; i <= n; i++)
for (int j = 2; j <= m; j++)
data[i][j] += data[i][j-1];
for (int i = 1; i <= m; i++)
for (int j = 1; j <= n; j++)
data[j][i] += data[j-1][i];
int Min = min(n,m);
for (ans = 0; ans <= Min; ans++)
if (check(ans))
continue;
else break;
if (ans)
ans--;
printf("%d\n",ans*ans);
}
return 0;
}