UVA 108 Maximum Sum

#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 sum[102][102];//sum[i][j]=k表示第j列从第一行到第i行的和为j
int N;
void show()
{
    for (int i=1;i<=N;i++)
    {
        for (int j=1;j<=N;j++)
        printf("%d ",sum[i][j]);
        putchar('\n');
    }
}
int main()
{
    //freopen("sample.txt","r",stdin);
    scanf("%d",&N);
    for (int i=1;i<=N;i++)
        for (int j=1;j<=N;j++)
    {
        scanf("%d",&sum[i][j]);
        sum[i][j]+=sum[i-1][j];
    }
    int ans=sum[1][1];
    //show();
    for (int i=0;i<=N;i++)
        for (int j=i+1;j<=N;j++)
    {
        int tmp=0;
        for (int k=1;k<=N;k++)
        {
           if (tmp<0)
            tmp=sum[j][k]-sum[i][k];
           else  tmp+=sum[j][k]-sum[i][k];//从第i行到第j行元素和 
           if (tmp>ans && sum!=0) ans=tmp;
        }
    }
    printf("%d\n",ans);
    return 0;
}