蓝桥杯-最大子阵

最大子阵

---

# include <stdio.h>
# include <string.h>
# include <stdlib.h>
# include <stdbool.h>
int main()
{
        int maxZ, maxF;bool vag = 0;
        maxZ = 0; maxF = -5050;
        int n, m, i, j, k, val, sum, sum1;
        int a[510][510];
        scanf("%d%d", &n, &m);
        for (i = 1; i <= n; i++)
        {
            for (j = 1; j <= m; j++)
            {
                a[0][j] = 0;
                scanf("%d", &val);
                a[i][j] = a[i-1][j] + val;
            }
        }
        for (i = 1; i <= n; i++)
        {
            for (j = i; j <= n; j++)
            {
                sum = 0;
                for (k = 1; k <= m; k++)
                {
                    sum1 = a[j][k] - a[i-1][k];
                    if (sum > 0)
                        sum += sum1;
                    else
                    {
                        sum = sum1;
                        if (!vag && sum > maxF)
                            maxF = sum;
                    }       
                    if (sum > maxZ)
                    {
                        maxZ = sum;
                        vag = 1;
                    }
                }
            }
        }
     if (!vag)
        maxZ = maxF;
    printf("%d\n",maxZ);
    return 0;
}