#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x ostream& operator<<(ostream& os, const pair& p){ return os << "{" << p.first << ", " << p.second << "}"; } template ostream& operator<<(ostream& os, const vector& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template ostream& operator<<(ostream& os, const set& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template ostream& operator<<(ostream& os, const map& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } #ifdef ONLINE_JUDGE #define dump(expr) ; #else #define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; } #endif ll solve() { ll n, p; cin >> n >> p; vector vh(n); for (int i : range(n)) cin >> vh[i]; vector> dp(n + 1, vector(2)); for (int i = n - 1; i >= 0; --i) { for (int dir : range(2)) { // dir = 0 => go right // dir = 1 => go left dp[i][dir] = p + min(dp[i + 1][0], dp[i + 1][1]); if (i < n - 1) { ll climb = max(vh[i + 1] - vh[i], 0LL); if (dir) climb = max(vh[i] - vh[i + 1], 0LL); dp[i][dir] = min(dp[i][dir], climb + dp[i + 1][dir]); } } } ll res = 1LL << 60; ll curr = 0; for (int i : range(n)) { res = min(res, curr + min(dp[i + 1][0], dp[i + 1][1])); if (i < n - 1) curr += max(vh[i + 1] - vh[i], 0LL); } return res; } int main() { cout << fixed << setprecision(12); cout << solve() << endl; }