POJ 3661 跑步+dp

最新推荐文章于 2019-02-20 01:10:23 发布

原创最新推荐文章于 2019-02-20 01:10:23 发布 · 597 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

ACM-动态规划专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一道关于牛牛跑步的问题，需要在限定时间内跑步并控制疲劳值，通过动态规划求解最大跑步距离。

Running

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6551		Accepted: 2440

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

9


题意：牛要跑步，输入n，m表示n分钟，要求疲劳值不超过m，然后是每分钟可以跑的距离
思路：
1，参照了某巨巨的思路才搞懂。
2，这题的状态转换很有意思，对于dp[i][0]要单独考虑。
因为出现休息的话，必须是从前面某个时间一直休息过来的，所以对于每个i要先处理dp[i][0]
那么dp[i][0]=max(dp[i][0],dp[i-j][j]) ;这很好理解，就是从i-j时刻疲劳度为j时转换过来的。
3，然后对于dp[i][j]那么它就应该就是只能是从dp[i-1][j-1]转换过来的
4，然后就没啥了，多练习应该是能想出来的。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn = 10005 ;
int dis[maxn] ;
int dp[maxn][505] ;
int main(){
    int n,m;
    while(~scanf("%d%d",&n,&m)){
        for(int i=1;i<=n;i++){
            scanf("%d",&dis[i]);
        }
        memset(dp,0,sizeof(dp));
        for(int i=1;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]+dis[i];
            }
        }
        printf("%d\n",dp[n][0]);
    }
    return 0;
}