HDU 1081
2012-10-08 20:42
197 查看
Two-dimensional maximum sum, only from one-dimensional changing
#include <stdio.h> #include <iostream> #include <string.h> using namespace std; #define LEN 110 #define MMAX(a,b) ((a)>(b)?a:b) int map[LEN][LEN]; int b[LEN]; int dp(int n) { int i, j; int retval = 0; int tmp = 0; for(i = 0; i < n; i++) { tmp += b[i]; if(tmp > retval) { retval = tmp; } else if(tmp < 0) { tmp = 0; } } return retval; } int main() { int n; int i, j, k; while(scanf("%d", &n) != EOF) { int mmax = 0; for(i = 0; i < n; i++) { for(j = 0; j < n; j++) { scanf("%d", &map[i][j]); } } for(i = 0; i < n; i++) { memset(b, 0,sizeof(b)); for(j = i; j < n; j++) { for(k = 0; k < n; k++) { b[k] += map[j][k]; } mmax = MMAX(mmax, dp(n)); } } printf("%d\n", mmax); } return 0; }
相关文章推荐
- HDU1081 To The Max
- hdu 1081 To The Max 最大子矩阵和(dp)
- hdu 1081 To The Max
- HDU 1081 To The Max (DP)
- HDU 1081 To The Max
- HDU 1081(经典动归,求最大子矩阵)
- hdu 1081 To The Max (简单题)....
- hdu 1081 to the max
- HDU 1081 To The Max
- hdu 1081 矩阵最大连续子序列
- HDU 1081 最大子 4000 矩阵和
- TOJ 1081 ZOJ 1149 HDU 1059 Dividing / 多重背包二进制优化
- hdu 1081 最大子矩阵和
- Hdu 1081 To The Max
- hdu 1081最大子矩阵的和DP
- HDU 1081 To The Max(dp最大子矩阵和)
- HDU 1081 To The Max
- hdu 1081 To The Max
- hdu 1081 To The Max
- Hdu 1081 长方形列举To The Max