POJ To the Max
来源:互联网 发布:风险矩阵法判断准则 编辑:程序博客网 时间:2024/06/13 01:00
Description
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
Output
Sample Input
40 -2 -7 0 9 2 -6 2-4 1 -4 1 -18 0 -2
Sample Output
15
Source
#include<stdio.h>
#include<string.h>
int min(int a,int b)
{
return a<b?a:b;
}
int max(int a,int b)
{
return a>b?a:b;
}
int array[105];
int sum[105][105];
int num[105][105];
int main()
{
int n;
while(~scanf("%d",&n))
{
sum[0][0]=0;
array[0]=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&num[i][j]);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
sum[i][j]=sum[i-1][j]+num[i][j];
int ans=-0x3f3f3f3f;
for(int up=1;up<=n;up++)
for(int down=up;down<=n;down++)
{
for(int i=1;i<=n;i++)
array[i]=array[i-1]+(sum[down][i]-sum[up-1][i]);
int mins=0;//保存1-(i-1)里面的最小值
for(int i=1;i<=n;i++)
{
ans=max(ans,array[i]-mins);
mins=min(mins,array[i]);
}
}
printf("%d\n",ans );
}
return 0;
}
- POJ to The Max
- POJ To the Max
- POJ 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
- 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
- poj 1050 to the max
- POJ 1050 To the Max
- poj 1050 to the max
- 悲剧!中小企业惨痛的外训经历!
- NOJ [1148] Creating Palindrome
- POJ Stars
- Nginx配置文件nginx.conf中文详解(总结)
- sp3
- POJ To the Max
- pdf在线转换成word官方免费版
- POJ 2777 Count Color
- NOJ [1120] Reimu\'s Teleport
- POJ Maximum sum
- NOJ [1132] Evil Wheel
- NBUT-2014暑期集训专题练习1 -> 二分法 A题
- NBUT-2014暑期集训专题练习1 -> 二分法E - E
- NBUT-2014暑期集训专题练习1 -> 二分法 J - J