uva 10827 球面最大子矩形

#include<cstdio>#include<cstring>using namespace std;int d[160][160];int s[160];int main(){int T;scanf("%d",&T);while(T--){int n,res=0;scanf("%d",&n);for(int i=0;i<n;i++)for(int j=0;j<n;j++){scanf("%d",&d[i][j]);d[i+n][j]=d[i][j+n]=d[i+n][j+n]=d[i][j];}for(int i=0;i<n;i++)for(int j=0;j<n;j++){memset(s,0,sizeof(s));for(int k=i;k<i+n;k++){int t=0;for(int p=j;p<j+n;p++){s[p]+=d[k][p];t+=s[p];if(t>res)res=t;}}} printf("%d\n",res);}}