UVA 10827

#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>

using namespace std;
#define MAXN 200
int num[MAXN][MAXN];

int main()
{
    int t, n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(num, 0, sizeof(num));
        for( int i = 1; i <= n; i++)
            for( int j = 1; j <= n; j++)
            {
                scanf("%d",&num[i][j]);
                num[i][j+n] = num[i+n][j] = num[i+n][j+n] = num[i][j];
            }
        for( int i = 1; i <= 2 * n; i++)
        {
            for( int j = 1; j <= 2 * n; j++)
                num[i][j] += num[i][j-1];
        }

        int maxn = -0x1f1f1f1f;
        //cout<<maxn<<endl;
       for(int i=1;i<=2*n;i++)
            for( int j=i;j<i+n&&j<=2*n;j++)
        {
            int tt;
            int a,b;
            for(a=1;a<=2*n;a++)
            {
                tt=0;
               for(b=a;b<a+n&&b<=2*n;b++)
               {
                   tt+=(num[b][j]-num[b][i-1]);
                   //printf("%d %d %d %d\n",i,j,a,b);
                   if(tt>maxn)
                    maxn=tt;
                   if(tt < 0)
                    tt = 0;
               }
            }

        }
        printf("%d\n",maxn);

    }
    return 0;
}