Submission #1306566

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>=0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()

const ll mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const double pi = 3.141592653589793;

ll n,e,t;
ll x[2005];
ll dp[2005][2005];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> e >> t;
    if (n>2000) return 0;
    rep(i,n) cin >> x[i+1];
    rep(i,n+2)rep(j,n+2) dp[i][j]=1e15;
    dp[0][0]=0;
    rep(i,n+1){
        ll nx=x[i+1]-x[i];
        rep(j,i+1){
            dp[i+1][j]=min(dp[i+1][j],dp[i][j]+nx);
            if (i==j) continue;
            dp[i][i]=min(dp[i][i],dp[i][j]+max(2*(x[i]-x[j+1]),t));
        }
    }
    cout << dp[n][n]+e-x[n] << endl;
    return 0;
}

Submission Info

Judge Result