UVA 10827 Maxsum升级版

#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
	return a % b == 0 ? b : gcd(b, a % b);
}
int N;
int a[200][200],b[200],c[200];
int main()
{
    freopen("sample.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while (T--)
    {
        int N;
        scanf("%d",&N);
        for (int i=0;i<N;i++)
            for (int j=0;j<N;j++)
        {
            scanf("%d",&a[i][j]);
            a[i+N][j]=a[i][j+N]=a[i+N][j+N]=a[i][j];
        }
        int ans=-999999999;
        for (int x=0;x<N;x++)
            for (int y=0;y<N;y++)
              for (int i=0;i<N;i++)
                for (int j=0;j<N;j++)
        {
            c[j]=a[x+j][y+i];//╣╠г╟ап+╨м
            if (j)c[j]+=c[j-1];
            if (i) b[j]+=c[j];
            else b[j]=c[j];
            if (b[j]>ans) ans=b[j];
        }
        printf("%d\n",ans);
    }
    return 0;
}