杭电2845 Beans 不连续的最大字段和
来源:互联网 发布:台湾电视台软件下载 编辑:程序博客网 时间:2024/05/16 15:22
Beans
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3999 Accepted Submission(s): 1903
Problem Description
Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 1*1 grid. Now you want to eat the beans and collect the qualities, but everyone must obey by the following rules: if you eat the bean at the coordinate(x, y), you can’t eat the beans anyway at the coordinates listed (if exiting): (x, y-1), (x, y+1), and the both rows whose abscissas are x-1 and x+1.
Now, how much qualities can you eat and then get ?
Now, how much qualities can you eat and then get ?
Input
There are a few cases. In each case, there are two integer M (row number) and N (column number). The next M lines each contain N integers, representing the qualities of the beans. We can make sure that the quality of bean isn't beyond 1000, and 1<=M*N<=200000.
Output
For each case, you just output the MAX qualities you can eat and then get.
Sample Input
4 611 0 7 5 13 978 4 81 6 22 41 40 9 34 16 1011 22 0 33 39 6
Sample Output
242
Source
2009 Multi-University Training Contest 4 - Host by HDU
Recommend
gaojie | We have carefully selected several similar problems for you: 2830 2577 2870 2844 1069
看图意思就是求,横向的最大不连续子段和,然后得到一个数组,求这个数组的最大不连续子段和,就是相求横向然后求纵向:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[5500],i,j,k,l,m,n,s[5500],ans[5500];int main(){while(scanf("%d%d",&n,&m)==2){int help=0;int x=0;k=0; memset(ans,0,sizeof(ans));for(i=1;i<=n;i++){int cmt=0;int cnt=0;memset(a,0,sizeof(a));for(j=1;j<=m;j++){scanf("%d",&a[j]);a[j]+=cmt; cnt=max(cnt,a[j]);//横向不连续的最大子段和 cmt=max(cmt,a[j-1]);}ans[i]=cnt+x;k=max(k,ans[i]);//纵向不连续的最大子段和 x=max(x,ans[i-1]);}printf("%d\n",k);}}
0 0
- 杭电2845 Beans 不连续的最大字段和
- hdu 2845 Beans 最大不连续字段和
- HDU 2845 Beans(DP,最大不连续和)
- HDU 2845 Beans(DP,最大不连续和)
- HDU 2845 Beans(最大不连续子序列和 dp)
- #HDU 2845 Beans 最大不连续子列和
- hdu 2845 Beans (最大不连续子序列的和)
- hdu2845 Beans (最大不连续子序列和)
- HDU 2845 Beans (最大不连续子序列和)(压缩求解)
- 暑期dp46道(38)--HDOJ 2845 Beans 最大不连续子序列和
- HDU 2845 Beans(最大不连续子序列)
- 最大连续字段和
- E题 最大连续字段的和
- hdu 2845 Beans(最长不连续子序列和)
- 不连续数列的最大和、最大连续数列和、最大间隔环
- 连续最大字段和与最大字段积
- dp 最大连续字段和 郁闷了
- hdu1231 最大连续字段和(DP)
- python 内置函数
- maven安装配置
- Qt信号槽函数用lambada表达式作为槽函数的陷阱
- PPPOE协议
- 练习1-e
- 杭电2845 Beans 不连续的最大字段和
- 《世冷》进行时
- virtual 虚函数的demo
- java 反斜杠转义
- python系列之 RabbitMQ - RPC
- RecyclerView添加addHeader和addFooter方法
- 将 JAR 转为 EXE – exe4j 的使用教程(第一期)
- PHP中的数据类型转换和类型检测
- Java面向对象06-多态,内部类