hdu 1081 & poj 1050 To The Max(最大和的子矩阵)
来源:互联网 发布:ubuntu光盘安装教程 编辑:程序博客网 时间:2024/06/05 05:56
转载请注明出处:http://blog.csdn.net/u012860063
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
Source
Greater New York 2001
题意:给你一个N*N的矩阵,求其中和最大的子矩阵的值!
代码如下:
#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>using namespace std;int main(){int i, j, k, t;int a, sum, max, N, m[147][147];while(~scanf("%d",&N)){memset(m,0,sizeof(m));for(i = 1; i <= N; i++){for(j = 1; j <= N; j++){scanf("%d",&a);m[i][j]+=m[i][j-1]+a;//表示第i行前j个数之和 }}max = -128;for(i = 1; i <= N; i++)//起始列 {for(j = i; j <= N; j++)//终止列 {sum = 0;for(k = 1; k <= N; k++)//对每一行进行搜索 {if(sum < 0)sum = 0;sum+=m[k][j]-m[k][i-1];//m[k][j]-m[k][i-1]表示第k行第i列之间的数 if(sum > max)max = sum;}}}printf("%d\n",max);}return 0;}
1 0
- hdu 1081 & poj 1050 To The Max(最大和的子矩阵)
- hdu 1081 To The Max ****poj 1050(最大子矩阵和)DP
- HDU 1081 & POJ 1050 To The Max (最大子矩阵和)
- POJ 1050 / HDU 1081 To the Max(最大子矩阵和)
- poj 1050 To the Max 最大子矩阵和
- poj 1050 To the Max(最大子矩阵和)
- poj 1050 To the Max(最大子矩阵和)
- POJ 1050-To the Max(最大子矩阵和)
- POJ 1050 To the Max (最大子矩阵和)
- [POJ 1050] To the Max DP+最大子矩阵和
- 【最大子矩阵和】poj 1050 To the Max
- poj 1050 To the Max(最大子矩阵和)
- poj 1050 To the Max -- 最大子矩阵和
- POJ 1050-To the Max(最大子矩阵和)
- hdu 1081、poj1050 To The Max 最大子矩阵和
- HDU 1081 To The Max(最大子矩阵和)
- HDU 1081 To The Max(最大子矩阵和)
- hdu 1081 To The Max(子矩阵最大和)
- quartz2.2.1 example 03代码分析
- 深入讲解MySQL授权表
- [Java]Instrumentation
- Web服务器管理系列:11、注意默认的隐含共享
- 二叉查找树
- hdu 1081 & poj 1050 To The Max(最大和的子矩阵)
- 我的第一篇博客
- UIImagePickerController获取图片名
- cocos2dx 3.0 js继承:John Resiq的继承写法解析
- 『ANDROID』Android学习与记录
- java实现简单的动态代理
- 【Android】 Android开发优化之——从代码角度进行优化
- web.xml文件的作用
- iOS开发-Xcode5创建静态库详解(Cocoa Touch Static Library)