NYOJ 104 最大和

http://acm.nyist.net/JudgeOnline/problem.php?pid=104

看了下别人的解题报告, 才知道原来还是相当于一维的数组的最大子序列的问题....

只是将二维的数组转换为一维的数组继续求最大子序列

#include <stdio.h>
#define maxn 101
int ans[maxn], temp[maxn][maxn];
int row(int n, int ans[])
{
    int i, b=0, sum=-1000000;
    for(i=0; i<n; i++)
    {
        if(b > 0) b += ans[i];
        else b = ans[i];
        if(sum < b) sum = b;
    }
    return sum;
}
int Maxmatrix(int n, int m)
{
    int i, j, l, sum=-100000, max;
    for(i = 0; i < n; i++)
    {
        for(j = 0; j < m; j++)
        ans[j] = 0;
        for(j = i; j < n; j++)
        {
            for(l = 0; l < m; l++)
            ans[l] += temp[j][l];
            max = row(l, ans);
            if(max > sum ) sum = max;
        }
    }
    return sum;
}

int main()
{
    int i, j, t, r, c;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&r,&c);
        for(i = 0; i < r; i++)
         for(j = 0; j < c; j++)
         scanf("%d",&temp[i][j]);
        printf("%d\n",Maxmatrix(r,c)); 
    }

}