标签:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10594 Accepted Submission(s): 5086
1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace std; 5 6 const int maxn=200; 7 int a[maxn][maxn]; 8 9 int main() 10 { 11 int n,t,sum,max; 12 while(scanf("%d",&n)!=EOF) 13 { 14 max=0; 15 for(int i=1;i<=n;i++){ 16 for(int j=1;j<=n;j++){ 17 scanf("%d",&t); 18 a[i][j]=a[i-1][j]+t; 19 } 20 } 21 22 for(int i=1;i<n-1;i++){ 23 for(int j=i;j<=n;j++){ 24 sum=0; 25 for(int k=1;k<=n;k++){ 26 t=a[j][k]-a[i-1][k]; 27 sum+=t; 28 if(sum<0) sum=0; 29 if(sum>max) max=sum; 30 } 31 } 32 } 33 printf("%d\n",max); 34 } 35 }
标签:
原文地址:http://www.cnblogs.com/cumulonimbus/p/5185080.html