AtCoder Grand Contest 007: D - Shik and Game (DP)

题目链接地址:https://agc007.contest.atcoder.jp/tasks/agc007_d

•  Editorial

D - Shik and Game

---

Time limit : 2sec / Memory limit : 256MB

Score : 1200 points

Problem Statement

Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear is located at xi. The maximum moving speed of the player is 1 while the bears do not move at all.

When the player gives a candy to a bear, it will provide a coin after T units of time. More specifically, if the i-th bear is given a candy at time t, it will put a coin at its position at time t+T. The purpose of this game is to give candies to all the bears, pick up all the coins, and go to the exit. Note that the player can only give a candy to a bear if the player is at the exact same position of the bear. Also, each bear will only produce a coin once. If the player visits the position of a coin after or at the exact same time that the coin is put down, the player can pick up the coin. Coins do not disappear until collected by the player.

Shik is an expert of this game. He can give candies to bears and pick up coins instantly. You are given the configuration of the game. Please calculate the minimum time Shik needs to collect all the coins and go to the exit.

Constraints

• 1≤N≤100,000
• 1≤T,E≤109
• 0<xi<E
• xi<xi+1 for 1≤i<N
• All input values are integers.

Partial Scores

• In test cases worth 600 points, N≤2,000.

---

Input

The input is given from Standard Input in the following format:

N E T
x1 x2 … xN

Output

Print an integer denoting the answer.

---

Sample Input 1

Copy

3 9 1
1 3 8

Sample Output 1

Copy

12

The optimal strategy is to wait for the coin after treating each bear. The total time spent on waiting is 3 and moving is 9. So the answer is 3+9=12.

---

Sample Input 2

Copy

3 9 3
1 3 8

Sample Output 2

Copy

16

---

Sample Input 3

Copy

2 1000000000 1000000000
1 999999999

Sample Output 3

Copy

2999999996

[题意]

从0-E  中间 有 n 个位置  , 每个位置有n 只熊,   每只熊当且仅当访问后,并在t 秒后, 产生一个金币;

现在 问你 把所有金币 都采集 并走到E 所用最短时间

[思路]

    对与 A ,B  两个点,  我们 这样想, A在前, B 在后,  走到A 后 对B 处的金币 有两种操作

    一是在 B 处等待T 秒, 

    二是先走到A 然后从A回到B 捡起硬币,然后在回到A   这个 时间时  2*[p(a) -p(b)]

    DP[i]  代表的某个点  耗费的时间

[code]

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int MAXN=1e5+5;
const ll inf=(1ll<<63-1);
ll a[MAXN];
ll dp[MAXN];
int main()
{
 
    ll n,e,t;
    cin>>n>>e>>t;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    memset(dp,(ll)0x3f3f3f3f,sizeof(dp));
    dp[0]=0;
    ll mn=inf;
    for(int i=1,now=0;i<=n;i++){
        while(t<=2*(a[i]-a[now+1]))
        {
            mn=min(mn,dp[now]-2*a[now+1]);
            now++;
        }
        dp[i]=dp[now]+t;
        dp[i]=min(dp[i],mn+2*a[i]);
 
    }
    cout<<e+dp[n]<<endl;
    return 0;
 
}

12