CSU-ACM2017暑假训练9-区间DP F
来源:互联网 发布:古墓丽影10优化补丁 编辑:程序博客网 时间:2024/06/14 16:59
F - Running
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
对于这题,有两类,共三种状态,分别为:第一类第一种,“疲劳值未满,继续奔跑”;第二类第一种,“从某时刻开始的休息结束了”;第二类第二种,“尽管之前已经休息了,但还是继续休息”。
其中,
只需要按照上述方程递推到
#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <cstring>#include <queue>using namespace std;int sample[10006], dp[10005][503];int main(){#ifdef TESTfreopen("test.txt", "r", stdin);#endif // TEST int n, m; while(cin >> n >> m){ memset(dp, 0, sizeof(dp)); for(int i = 1; i <= n; i++) scanf("%d", &sample[i]); for(int i = 1; i <= n; i++){ for(int j = 1; j <= m; j++){ dp[i][j] = dp[i-1][j-1] + sample[i]; } dp[i][0] = dp[i-1][0]; for(int k = 1; k < i && k <= m; k++)//注意k<=m的条件。如不加以限制会超时。 dp[i][0] = max(dp[i][0], dp[i-k][k]); } cout << dp[n][0] << endl; } return 0;}
阅读全文
0 0
- CSU-ACM2017暑假训练9-区间DP F
- CSU-ACM2017暑假训练9-区间DP C
- CSU-ACM2017暑假训练9-区间DP D
- CSU-ACM2017暑假训练9-区间DP E
- CSU-ACM2017暑假训练9-区间DP G
- CSU-ACM2017暑期训练4-dfs F
- CSU-ACM2017暑期训练12-KMP F
- CSU-ACM2017暑假集训2-二分搜索 F
- CSU-ACM2017暑期训练7-模拟&&贪心 F
- CSU-ACM2017暑期训练8-动态规划初步 F
- CSU-ACM2017暑期训练10-并查集&&HASH F
- CSU-ACM2017暑期训练16-树状数组 F
- 暑假训练-训练8 区间DP
- CSU-ACM2017暑假集训比赛1 C
- CSU-ACM2017暑假集训比赛1 B
- CSU-ACM2017暑假集训比赛1 A
- CSU-ACM2017暑假集训比赛1 C
- CSU-ACM2017暑假集训比赛1 C
- hung task机制学习
- linux 开发网址
- CSU-ACM2017暑假训练9-区间DP E
- HDU 1429 胜利大逃亡(续) (BFS )
- linux源码编译安装http服务
- CSU-ACM2017暑假训练9-区间DP F
- 食物链 POJ
- C/C++ 内存分配:malloc/calloc/realloc/free和new/delete
- HDUOJ 1027 Ignatius and the Princess II
- 一个移植十分方便的malloc函数族的实现
- CSU-ACM2017暑假训练9-区间DP G
- IO流(3)—字节流
- Python小白进阶4:基于Kmeans的图像分割
- php单元测试