POJ 3661 Running（区间DP）

最新推荐文章于 2019-06-08 20:49:46 发布

mrcoderrev

最新推荐文章于 2019-06-08 20:49:46 发布

阅读量160

点赞数

分类专栏：区间DP

本文链接：https://blog.csdn.net/yjf3151731373/article/details/52684776

版权

区间DP 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Running

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu

Submit Status

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 D_i (1 ≤ D_i ≤ 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: D_i

Output

* Line 1: A single integer representing the largest distance Bessie can run while satisfying the conditions.
　

Sample Input

Sample Output

状态转移的思维不好想，反正我是没想出来，，，；

求什么变量，下标就尽量去表示这个变量用中间量去优化时，主要就是保证能使结果得到优化

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 10005;
int v[N], dp[N][505];

int main()
{
int n, m;
while(scanf("%d %d", &n, &m)!=EOF)
{
for(int i=1;i<=n;i++)
scanf("%d", &v[i]);
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
dp[i][j]=dp[i-1][j-1]+v[i];
dp[i][0]=dp[i-1][0];
for(int k=1;k<=m&&k<=i-k;k++)
dp[i][0]=max(dp[i-k][k],dp[i][0]);
}
printf("%d\n",dp[n][0]);
}
return 0;
}