TO THE MAX
来源:互联网 发布:effective java的缺点 编辑:程序博客网 时间:2024/06/01 09:58
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.
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
40 -2 -7 0 9 2 -6 2-4 1 -4 1 -18 0 -2
Sample Output
15
#include<stdio.h>#include<algorithm>#include<iostream>#include<string.h>#include<stdlib.h>#include<queue>#include<vector>#include<math.h>#include<map>using namespace std;const int MAX = 100+10;int main(){ int a[MAX][MAX], n, b[MAX][MAX], t, maxx, sum; scanf("%d", &n); for(int i = 1; i<=n; ++i)for(int j = 1;j<=n; ++j){scanf("%d", &t);a[i][j] = a[i-1][j]+t;}maxx = sum = 0;for(int i= 1; i<=n;++i){for(int j = i; j<=n;++j){sum = 0;for(int k =1; k<=n;++k){sum+=a[j][k]-a[i][k];if(sum<0)sum = 0;if(sum>maxx)maxx = sum;}}}printf("%d", maxx); return 0;}
0 0
- zoj1074 To the Max
- 1074 To the Max
- 1050 To the Max
- POJ1050 To the Max
- POJ1050 To the Max
- POJ to The Max
- 1081 To The Max
- To the Max
- To the max(hdu1081)
- POJ To the Max
- 1050--To the Max
- POJ1050 To the Max
- poj1050 to the max
- To The Max
- HDU1081--To The Max
- poj1050 To the Max
- poj1050 To the Max
- POJ1050--To the Max
- 基础知识之OB系统函数
- 第4周项目1 -建立单链表
- 电脑不用下软件开wifi
- 【hdu 5880】 【AC自动机+差分法】Family View 把匹配到的敏感词改成*
- 4. jQuery Mobile 过渡(transitions)
- TO THE MAX
- Android样式的使用和样式继承
- MySQL和Redis 数据同步解决方案整理
- 安卓RecyclerView使用教程
- swift与objc混编
- ScrollView嵌套ListView数据显示不完全解决办法
- 十进制与十六进制的互换
- HTML5学习_day02(1)--css高级选择器
- SearchView的功能与使用