Poj 1050 分类: Translation Mode 2014-04-04 09:31 103人阅读 评论(0) 收藏
2014-04-04 09:31
561 查看
To the Max
Description
Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*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.
Input
The input consists of an N * 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
Sample Output
题目大意:
给定一个包含正负数的二维矩阵,子矩阵是任何连续大小大于或等于1*1的子阵的整个数组,这个矩阵的和就等于矩阵中所有元素之和,和最大的子矩阵被称为最大矩阵。
也就是让你输出最大矩阵的和
推荐:http://acm.nyist.net/JudgeOnline/problem.php?pid=104
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 39058 | Accepted: 20629 |
Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*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.
Input
The input consists of an N * 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
4 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2
Sample Output
15
题目大意:
给定一个包含正负数的二维矩阵,子矩阵是任何连续大小大于或等于1*1的子阵的整个数组,这个矩阵的和就等于矩阵中所有元素之和,和最大的子矩阵被称为最大矩阵。
也就是让你输出最大矩阵的和
推荐:http://acm.nyist.net/JudgeOnline/problem.php?pid=104
相关文章推荐
- Poj 1032 分类: Translation Mode 2014-04-04 09:09 111人阅读 评论(0) 收藏
- Poj 2349 Arctic Network 分类: Brush Mode 2014-07-20 09:31 93人阅读 评论(0) 收藏
- Poj 1029 分类: Translation Mode 2014-04-04 10:18 112人阅读 评论(0) 收藏
- Speed Limit 分类: POJ 2015-06-09 17:47 9人阅读 评论(0) 收藏
- Borg Maze 分类: POJ 2015-07-27 15:28 5人阅读 评论(0) 收藏
- Labeling Balls 分类: POJ 2015-07-28 19:47 10人阅读 评论(0) 收藏
- Dirichlet's Theorem on Arithmetic Progressions 分类: POJ 2015-06-12 21:07 7人阅读 评论(0) 收藏
- poj 1568 分类: poj templates 2015-08-08 16:09 6人阅读 评论(0) 收藏
- poj 3974 分类: poj templates 2015-07-05 22:24 18人阅读 评论(0) 收藏
- poj1741 分类: poj 2015-02-08 03:40 101人阅读 评论(0) 收藏
- poj 3237 分类: poj 2015-04-14 21:11 36人阅读 评论(0) 收藏
- Maya Calendar 分类: POJ 2015-06-11 21:44 12人阅读 评论(0) 收藏
- Android中保存和恢复Fragment状态的最好方法 分类: Android 2015-07-29 13:59 103人阅读 评论(0) 收藏
- poj 2828 分类: poj 2015-03-06 21:49 38人阅读 评论(0) 收藏
- poj 3481 分类: poj 2015-03-07 20:19 218人阅读 评论(2) 收藏
- poj 3667 分类: poj templates 2015-03-30 22:13 31人阅读 评论(0) 收藏
- poj2486 分类: poj 2015-07-20 10:21 12人阅读 评论(0) 收藏
- poj 2104 分类: poj 2015-02-09 23:23 91人阅读 评论(0) 收藏
- THE DRUNK JAILER 分类: POJ 2015-06-10 14:50 13人阅读 评论(0) 收藏
- MS SQL数据批量备份还原(适用于MS SQL 2005+) 分类: SQL Server 数据库 2015-03-10 14:32 103人阅读 评论(0) 收藏