Codeforces Round #595 (Div. 3)

Codeforces Round #595 (Div. 3)

B

# include <bits/stdc++.h>
using namespace std;
​
const int MAXN=2e5+100;
int a[MAXN],b[MAXN];
int dp[MAXN][2];
int main()
{
    int n,c;
    scanf("%d%d",&n,&c);
    for(int i=2;i<=n;i++) scanf("%d",&a[i]);
    for(int i=2;i<=n;i++) scanf("%d",&b[i]);
    dp[1][1]=c; cout<<0;
    for(int i=2;i<=n;i++){
        dp[i][0]=min(dp[i-1][0],dp[i-1][1])+a[i];
        dp[i][1]=min(dp[i-1][0]+c,dp[i-1][1])+b[i];
        cout<<" "<<min(dp[i][0],dp[i][1]);
    }
    return 0;
}
​