原题地址108-MaximunSum
大意:求矩阵最大连续和。是对一维序列最大连续和问题的扩展,具体参考
思路:将二维转化为一维,枚举所有行的情况
代码如下:
结果:AC
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n;
int a[105][105];
int sum[105][105];
int main()
{
memset(sum, 0, sizeof(sum));
while (cin >> n&&n != 0)
{
for(int i=1;i<=n;i++)
for (int j = 1; j <= n; j++)
{
cin >> a[i][j];
sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+a[i][j];
}
int max = -(1 << 30);
for (int i = 1; i <= n; i++)
{
for (int j = i; j <= n; j++)
{
int min = 0;
for (int k = 1; k <= n; k++)
{
int temp = sum[j][k] - sum[j - i][k] - min;
if (temp > max)max = temp;
if (sum[j][k] - sum[j - i][k] < min)min = sum[j][k] - sum[j - i][k];
}
}
}
cout << max << endl;
}
}