zoj1074 To the Max

1. //zoj1074 To the Max
2. //Accepted 1074 C ++ 00:00.00 428K
3. #include <stdio.h>
4. #define INF 1000000
5. #define MAXN 100
6. #define MAXM 100
7. //最大子段和O(n)
8. int maxsum(int b[MAXN],int n)
9. {
10.        int sum=-INF,ts=0;
11.        for (int i=0; i<n; ++i){
12.               if (ts>0) ts += b[i];
13.               else ts = b[i];
14.               if (ts>sum)     sum = ts;
15.        }
16.        return sum;
17. }
18. //最大子阵和O(nm^2)
19. int maxsum2(int a[][MAXN],int m,int n)
20. {
21.        int sum=-INF,ts;
22.        int b[MAXN];
23.        for (int i=0; i<m; ++i){
24.               for (int k=0; k<n; ++k) b[k] = a[i][k];
25.               for (int j=i+1; j<m; ++j){
26.                      for (int k=0; k<n; ++k) b[k] += a[j][k];
27.                      ts = maxsum(b,n);
28.                      if (ts>sum) sum = ts;
29.               }
30.        }
31.        return sum;
32. }
33.  
34. int n;
35. void solve()
36. {
37.        int a[MAXM][MAXN];
38.        for (int i=0; i<n; ++i)
39.               for (int j=0; j<n; ++j)
40.                      scanf ("%d",&a[i][j]);
41.        printf ("%d/n",maxsum2(a,n,n));
42. }
43.  
44. int main()
45. {
46. #ifdef ONLINE_JUDGE
47. #else
48.        freopen("1074.txt","r",stdin);
49. #endif
50.        while (scanf("%d",&n)!=EOF)
51.               solve();
52. #ifdef ONLINE_JUDGE
53. #else
54.        fclose(stdin);
55. #endif
56.        return 0;
57. }