E. By Elevator or Stairs?

http://codeforces.com/contest/1249/problem/E

#include <bits/stdc++.h>
#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>

#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int mod=1e9+7;
const int N=2e5+9;

ll a[N],b[N];
ll sum1[N],sum2[N];
ll dp[N][2];
int main()
{
    FAST_IO;

    int n, c;
    cin >> n >> c;

    for( int i = 1; i < n ; i ++ )
    {
        cin >> a[i];
    }

    for( int i = 1; i < n; i ++ )
    {
        cin >> b[i];
    }

    for( int i = 1; i <= n; i++ ) dp[i][0]=dp[i][1]=INF;

    dp[0][0]=0;
    dp[0][1]=c;
    cout << 0 << ' ';
    for(int i = 1; i < n; i++ ){

        dp[i][0]=min(dp[i-1][0]+a[i],dp[i-1][1]+b[i]);
        dp[i][1]=min(dp[i-1][0]+a[i]+c,dp[i-1][1]+b[i]);
        cout << min(dp[i][0],dp[i][1]) << ' ';
    }





    return 0;
}