POJ Running (DP)
来源:互联网 发布:java修改静态变量的值 编辑:程序博客网 时间:2024/06/05 01:52
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[100005];int dp[100005][500];int main(){ int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } dp[1][0]=0; dp[1][1]=a[1]; for(int i=2;i<=n;i++) { dp[i][0]=dp[i-1][0]; for(int j=1;j<=m;j++) { if(i-j>=0) dp[i][0]=max(dp[i][0],dp[i-j][j]); dp[i][j]=dp[i-1][j-1]+a[i]; } } printf("%d\n",dp[n][0]);}
Description
The cows are trying to become better athletes, so Bessie is running on a track for exactly N (1 ≤ N ≤ 10,000) minutes. During each minute, she can choose to either run or rest for the whole minute.
The ultimate distance Bessie runs, though, depends on her 'exhaustion factor', which starts at 0. When she chooses to run in minute i, she will run exactly a distance of Di (1 ≤ Di ≤ 1,000) and her exhaustion factor will increase by 1 -- but must never be allowed to exceed M (1 ≤ M ≤ 500). If she chooses to rest, her exhaustion factor will decrease by 1 for each minute she rests. She cannot commence running again until her exhaustion factor reaches 0. At that point, she can choose to run or rest.
At the end of the N minute workout, Bessie's exaustion factor must be exactly 0, or she will not have enough energy left for the rest of the day.
Find the maximal distance Bessie can run.
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 contains the single integer: Di
Output
* Line 1: A single integer representing the largest distance Bessie can run while satisfying the conditions.
Sample Input
5 2534210
Sample Output
9
- POJ 3661 Running (DP)
- poj 3661 Running DP
- poj 3661 Running (dp)
- poj 3661 Running dp
- [dp] poj 3661 Running
- poj 3661 dp(Running)
- POJ 3661 Running(dp)
- POJ Running (DP)
- POJ-3661 Running(dp)
- poj 3661 Running (区间DP)
- POJ 3661-Running(DP)
- poj 3661 Running(dp)
- 区间DP POJ 3661 Running
- Poj 3661 Running(DP)
- poj 3661 Running(dp,设计状态,)
- POJ 3661 Running(区间dp)
- poj 3661 Running(区间dp)
- POJ 3661 Running(区间DP)
- Android studio 导入github工程
- 从网易云看音乐推荐系统
- Android最佳性能实践(二)——分析内存的使用情况
- So Far Away
- Windows程序内部运行机制笔记
- POJ Running (DP)
- android configChanges
- insmod: can't insert 'adc.ko': Device or resource busy:
- RESTful架构详解
- 图像去噪
- java中关键字super和this的使用
- linux 下的source命令讲解
- iOS7之后,关于NavigationBar存在时,UIScrollView内容发生偏移的问题
- Android最佳性能实践(三)——高性能编码优化