【codeforces 723 B Cormen — The Best Friend Of a Man】
来源:互联网 发布:淘宝男士休闲鞋2015款 编辑:程序博客网 时间:2024/06/05 10:26
Cormen — The Best Friend Of a Man
B. Cormen — The Best Friend Of a Man
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 = 5 and 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 a1, a2, …, an, where ai 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 integers b1, b2, …, bn (bi ≥ ai), where bi 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 a1, a2, …, an (0 ≤ ai ≤ 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 b1, b2, …, bn, where bi — the total number of walks on the i-th day according to the found solutions (ai ≤ bi for all i from 1 to n). If there are multiple solutions, print any of them.
Examples
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
思路还是很好想的 : 在当前啊a[i] + a[i + 1] < k 时,a[i + 1] += k - a[i] ,需要多走的步数 ans += k - a[i ];
#include<cstdio>int pa[500];int main(){ int N,M,ans = 0,i,cut; scanf("%d %d",&N,&M); for(i = 1 ; i <= N ; i++) scanf("%d",&pa[i]); for(i = 2 ; i <= N; i++){ cut = pa[i - 1] + pa[i]; if(cut < M){ pa[i] += M - cut; ans += M - cut; } } printf("%d\n",ans); for(i = 1 ; i < N; i++) printf("%d ",pa[i]); printf("%d\n",pa[N]); return 0;}
- codeforces 732B - Cormen --- The Best Friend Of a Man
- 【codeforces 723 B Cormen — The Best Friend Of a Man】
- B. Cormen — The Best Friend Of a Man
- codeforces 732B Cormen — The Best Friend Of a Man (水题)
- CodeForces 732B Cormen — The Best Friend Of a Man
- Codeforces Round #377 (Div. 2) B. Cormen — The Best Friend Of a Man
- Codeforces 732B Cormen — The Best Friend Of a Man【贪心】
- Codeforces 732B-Cormen—The Best Friend Of a Man
- CodeForces 732B 之 Cormen — The Best Friend Of a Man
- CodeForces 732B Cormen — The Best Friend Of a Man
- CodeForces-732B-Cormen — The Best Friend Of a Man(简单模拟)
- CodeForces 732 B.Cormen — The Best Friend Of a Man(贪心)
- codeforces 732B Cormen — The Best Friend Of a Man
- CodeForces 732B Cormen — The Best Friend Of a Man
- 【56.74%】【codeforces 732B】Cormen --- The Best Friend Of a Man
- CodeForces 732B Cormen — The Best Friend Of a Man(带着宠物轧马路)
- Cormen — The Best Friend Of a Man (贪心)
- codeforce#377B. Cormen — The Best Friend Of a Man
- bShare分享插件的使用
- leetcode facebook 面试题 Merge two interval lists
- laravel 学习笔记三 :错误&日志
- CircleProgressBar 两个进度值的 圆环进度条,原谅我是个小白,只能写一写简单的自定义控件
- windows与linux socket程序的不同
- 【codeforces 723 B Cormen — The Best Friend Of a Man】
- 围城—漩涡之城
- Call matlab in python
- CircleImageView-方式2
- 一条update语句,更新多个列,出现部分成功部分失败的问题
- 图像识别(2)——《OpenCV3编程入门》毛星云编著
- 用VpnService实现网络防火墙
- Ubuntu安裝MySQL
- 文件的保存读取方法(笔记)