Submission #1988724

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <array>
#include <vector>
#include <utility>
#include <bitset>
#include <queue>

using namespace std;

typedef long long ll;

constexpr ll MAX_N = 1e5;
constexpr ll INF = 1e10;
ll N, E, T;
vector<ll> X;

int main(void) {
    cin >> N >> E >> T;
    X.push_back(0);
    for (size_t i = 0; i < N; i++) {
        ll x;
        cin >> x;
        X.push_back(x);
    }

    vector<ll> dp(N + 1, 0);

    dp[1] = T;
    for (ll i = 2, j = 0, k = INF; i <= N;) {
        ll L = max(2 * (X[i] - X[j + 1]), T);
        if (L == T) {
            dp[i] = min(dp[j] + T, k);
            i++;
        } else {
            ll dpj = dp[j] + L;
            if (dpj < k) {
                k = dpj;
            }
            j++;
        }
    }

    cout << dp[N] + E << endl;
    return 0;
}

Submission Info

Judge Result