hdu 1081 to be max
来源:互联网 发布:搜狗输入法 编程皮肤 编辑:程序博客网 时间:2024/06/13 00:59
Problem Description
Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle.
As an example, the maximal sub-rectangle of the array:
0 -2 -7 0
9 2 -6 2
-4 1 -4 1
-1 8 0 -2
is in the lower left corner:
9 2
-4 1
-1 8
and has a sum of 15.
As an example, the maximal sub-rectangle of the array:
0 -2 -7 0
9 2 -6 2
-4 1 -4 1
-1 8 0 -2
is in the lower left corner:
9 2
-4 1
-1 8
and has a sum of 15.
Input
The input consists of an N x N array of integers. The input begins with a single positive integer N on a line by itself, indicating the size of the square two-dimensional array. This is followed by N 2 integers separated by whitespace (spaces and newlines). These are the N 2 integers of the array, presented in row-major order. That is, all numbers in the first row, left to right, then all numbers in the second row, left to right, etc. N may be as large as 100. The numbers in the array will be in the range [-127,127].
Output
Output the sum of the maximal sub-rectangle.
Sample Input
40 -2 -7 0 9 2 -6 2-4 1 -4 1 -18 0 -2
Sample Output
15
Source
Greater New York 2001
算法:最小子列和比较简单,二维问题可以通过枚举一个i,j降为一维问题。
代码:
#include <iostream>#include <algorithm>#include <stdlib.h>#include <string.h>using namespace std;int dp[110];int m[110][110];int PreSum[110][110];int ary[110];int n;int Result;bool Input();void Caculate();int GetDp();int main(){while(cin>>n){Input();Caculate();cout<<Result<<endl;}}bool Input(){memset(PreSum, 0, sizeof(PreSum));for(int i = 0; i < n; ++i){for(int j = 1; j <= n; ++j){cin>>m[i][j];PreSum[i][j] = PreSum[i][j-1] + m[i][j];}}return true;}void Caculate(){Result = -0x0FFFFFFF;for(int i =0; i <= n; ++i){for(int j = i + 1; j <= n; ++j){for(int l = 0; l < n; ++l){ary[l] = PreSum[l][j] - PreSum[l][i];}Result = max(Result, GetDp());}}}int GetDp(){memset(dp, 0, sizeof(dp));dp[0] = ary[0];for(int i = 1; i < n; ++i){dp[i] = max(dp[i-1] + ary[i], ary[i]);}return *max_element(dp, dp + n);}结果:Run IDSubmit TimeJudge StatusPro.IDExe.TimeExe.MemoryCode Len.LanguageAuthor158223022015-12-11 21:45:43Accepted108131MS1888K963 BC++BossJue
0 0
- hdu 1081 to be max
- HDU 1081 To the Max
- HDU 1081 To The Max
- HDU 1081 To The Max
- hdu 1081 To The Max
- hdu 1081 to the max
- hdu 1081 To The Max
- hdu 1081 To The Max
- hdu 1081 To The Max
- hdu 1081 To The Max
- HDU 1081 To The Max
- hdu 1081 To The Max
- hdu 1081 To The Max
- hdu 1081 To The Max
- HDU 1081 To The Max
- hdu 1081 To The Max
- HDU 1081 To The Max
- hdu 1081 To The Max
- java编程思想(读书笔记):9.持有你的对象
- leetcode303-range sum query-python
- 3种LVS/Nginx/HAProxy负载均衡器的对比分析
- 工作中实用shell脚本与语句
- java泛型(二)、泛型的内部原理:类型擦除以及类型擦除带来的问题
- hdu 1081 to be max
- java泛型(三)、通配符的使用
- [LeetCode]029-Divide Two Integers
- cmd的forfiles命令详解
- linux c++ 利用timerfd和epoll封装计时器(Timer)类
- 大型网站架构演化历程
- android stdio安装记录
- 深入分析Parquet列式存储格式
- hdu2795Billboard(线段树)