Jumping Cows（dp）

最新推荐文章于 2020-04-10 20:45:42 发布

浅梦曾倾

最新推荐文章于 2020-04-10 20:45:42 发布

阅读量389

点赞数

本文链接：https://blog.csdn.net/qq_45949914/article/details/105231790

版权

本文介绍了一道动态规划问题，通过给定的一系列药剂（每种药剂具有不同的强度），目标是在遵循特定规则下，确定如何使用这些药剂以达到最大的跳跃效果。奇数天服用增加跳跃力的药剂，偶数天则服用减少跳跃力的药剂。文章详细解释了使用二维动态规划解决问题的方法，并提供了完整的代码实现。

摘要由CSDN通过智能技术生成

【问题】

Farmer John’s cows would like to jump over the moon, just like the cows in their favorite nursery rhyme. Unfortunately, cows can not jump.
The local witch doctor has mixed up P (1 <= P <= 150,000) potions to aid the cows in their quest to jump. These potions must be administered exactly in the order they were created, though some may be skipped.
Each potion has a ‘strength’ (1 <= strength <= 500) that enhances the cows’ jumping ability. Taking a potion during an odd time step increases the cows’ jump; taking a potion during an even time step decreases the jump. Before taking any potions the cows’ jumping ability is, of course, 0.
No potion can be taken twice, and once the cow has begun taking potions, one potion must be taken during each time step, starting at time 1. One or more potions may be skipped in each turn.
Determine which potions to take to get the highest jump.

【输入】

Line 1: A single integer, P
Lines 2…P+1: Each line contains a single integer that is the strength of a potion. Line 2 gives the strength of the first potion; line 3 gives the strength of the second potion; and so on.

【输出】

Line 1: A single integer that is the maximum possible jump.

【思路】

题意：给出每天力量数，单数天加力量，双数天减力量，问怎样力量最大
二维dp，dp[i][0]表示已经吃奇数个药，dp[i][1]表示已经吃偶数个药，一遍dp然后找最大值就行
具体看代码吧

【源代码】

#include<iostream>
#include<cstdio>
#include<string>
#include<cstdlib>
#include<cmath>
using namespace std;
#include<stack>
#include<cstdlib>
#include<string>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<map>
#define ll long long
int dp[160000][2];
//int a[160000];
int main()
{
    int n,maxx,t;
    while(scanf("%d",&n)!=EOF)
    {
        dp[0][0] = 0;
    dp[0][1] = 0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&t);
        dp[i][0] = max(dp[i-1][0],dp[i-1][1]-t);
        dp[i][1] = max(dp[i-1][1],dp[i-1][0]+t);
    }
    maxx = max(dp[n][0],dp[n][1]);
    printf("%d\n",maxx);
    }
    return 0;
}