CodeForces 732B 之 Cormen — The Best Friend Of a Man

Description

Recently a dog was bought for Polycarp. The dog's name is Cormen. Now Polycarp has a lot of troubles. For example, Cormen likes going for a walk.

Empirically Polycarp learned that the dog needs at least k walks for any two consecutive days in order to feel good. For example, if k = 5and yesterday Polycarp went for a walk with Cormen 2 times, today he has to go for a walk at least 3 times.

Polycarp analysed all his affairs over the next n days and made a sequence of n integers a₁, a₂, ..., a_n, where a_i is the number of times Polycarp will walk with the dog on the i-th day while doing all his affairs (for example, he has to go to a shop, throw out the trash, etc.).

Help Polycarp determine the minimum number of walks he needs to do additionaly in the next n days so that Cormen will feel good during all the n days. You can assume that on the day before the first day and on the day after the n-th day Polycarp will go for a walk with Cormen exactly k times.

Write a program that will find the minumum number of additional walks and the appropriate schedule — the sequence of integersb₁, b₂, ..., b_n (b_i ≥ a_i), where b_i means the total number of walks with the dog on the i-th day.

Input

The first line contains two integers n and k (1 ≤ n, k ≤ 500) — the number of days and the minimum number of walks with Cormen for any two consecutive days.

The second line contains integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 500) — the number of walks with Cormen on the i-th day which Polycarp has already planned.

Output

In the first line print the smallest number of additional walks that Polycarp should do during the next n days so that Cormen will feel good during all days.

In the second line print n integers b₁, b₂, ..., b_n, where b_i — the total number of walks on the i-th day according to the found solutions (a_i ≤ b_i for all i from 1 to n). If there are multiple solutions, print any of them.

Sample Input

Input

3 5
2 0 1

Output

4
2 3 2

Input

3 1
0 0 0

Output

1
0 1 0

Input

4 6
2 4 3 5

Output

0
2 4 3 5

题目大意：给你n个数，你可以任意增大每个数，使得任意两个相邻数之和不小于k,求最少增加多少？并输出增加之后的的n个数

AC代码如下：
#include <iostream>
#include <cstdio>
using namespace std;

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main(int argc, char** argv) {
	int n,k;
	int a[550],b[550];
	while(cin>>n>>k)
	{
		for(int i=0;i<n;i++)
		{
			cin>>a[i];
		}
		int ans=0;
		for(int i=0;i<n-1;i++)
		{
			if(a[i]+a[i+1]<k)
			{
				ans+=k-(a[i]+a[i+1]);
				a[i+1]=a[i+1]+k-(a[i]+a[i+1]);
			}
		}
		cout<<ans<<endl;
		for(int i=0;i<n;i++)
		{
			if(i==n-1)
				cout<<a[i]<<endl;
			else
			cout<<a[i]<<" ";
		}
	}
	return 0;
}