先上题目:
Time Limit: 30000/10000 MS
(Java/Others) Memory Limit: 32768/32768 K
(Java/Others)
Total Submission(s): 2523 Accepted
Submission(s): 1288
1 #include <cstdio> 2 #include <cstring> 3 #define MAX 1002 4 #define max(x,y) (x > y ? x : y) 5 using namespace std; 6 7 int s[MAX][MAX]; 8 int cy[MAX][MAX]; 9 10 int main() 11 { 12 int t; 13 int n,m,x,y,maxn,sum; 14 //freopen("data.txt","r",stdin); 15 scanf("%d",&t); 16 while(t--){ 17 scanf("%d %d %d %d",&n,&m,&y,&x); 18 for(int i=1;i<=n;i++){ 19 for(int j=1;j<=m;j++){ 20 scanf("%d",&s[i][j]); 21 } 22 } 23 memset(cy,0,sizeof(cy)); 24 for(int j=1;j<=m;j++){ 25 for(int i=1;i<=n;i++){ 26 cy[i][j]+=s[i][j]+cy[i-1][j]; 27 } 28 } 29 maxn=0; 30 int i,j; 31 for(i=1,j=y;j<=n;i++,j++){ 32 sum=0; 33 for(int k=1;k<=m;k++){ 34 sum+=cy[j][k]-cy[i-1][k]; 35 if(k>x){ 36 sum-=cy[j][k-x]-cy[i-1][k-x]; 37 } 38 maxn=max(sum,maxn); 39 } 40 } 41 printf("%d\n",maxn); 42 } 43 return 0; 44 }
HDU - 1559 - 最大子矩阵,布布扣,bubuko.com
原文:http://www.cnblogs.com/sineatos/p/3585578.html