标签：order int lang 连续 mem oca row inf its
Description
Input
Output
Sample Input
4
0 -2 -7 0 9 2 -6 2
-4 1 -4 1 -1
8 0 -2
Sample Output
15
和最大连续子串和类似，可以把二维的转化为一维，将i行到j行的各列数分别相加，求最大连续子串和即可。
同时可利用前缀和，sum[i][j]表示第j列前i行相加的和，i从1开始，则i-j行相加的和为sum[j][k]-sum[i-1][k]
#include <iostream> #include <stdio.h> #include <cstring> #include <algorithm> using namespace std; #define INF 0x3f3f3f3f int a[110][110]; int t[110], dp[110]; int sum[110][110]; int n; int sovle() { int ans = -INF; for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { int Max; dp[1] = sum[j][1] - sum[i-1][1]; for (int k = 1; k <= n; k++) { int temp = sum[j][k]-sum[i-1][k]; dp[k] = max(dp[k-1]+temp, temp); } Max = *max_element(dp+1, dp+n+1); if (Max > ans) ans = Max; } } return ans; } int main() { //freopen("1.txt", "r", stdin); scanf("%d", &n); memset(sum, 0, sizeof(sum)); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { scanf("%d", &a[i][j]); sum[i][j] = sum[i-1][j] + a[i][j]; } printf("%d\n", sovle()); return 0; }
标签：order int lang 连续 mem oca row inf its
原文地址：http://www.cnblogs.com/whileskies/p/7191428.html
