CodeForces 732B 之 Cormen — The Best Friend Of a Man
来源:互联网 发布:用excel给数据取对数 编辑:程序博客网 时间:2024/06/05 09:34
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 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 integersb1, 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.
Sample Input
3 52 0 1
42 3 2
3 10 0 0
10 1 0
4 62 4 3 5
02 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;elsecout<<a[i]<<" ";}}return 0;}
- 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 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
- B. Cormen — The Best Friend Of a Man
- 【56.74%】【codeforces 732B】Cormen --- The Best Friend Of a Man
- 【codeforces 723 B 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(带着宠物轧马路)
- Cormen — The Best Friend Of a Man (贪心)
- codeforce#377B. Cormen — The Best Friend Of a Man
- 常用表空间&数据文件监控语句
- Day32: Forgeten day
- 198. House Robber&213. House Robber II&337. House Robber III
- Win7(Windows 7)下用VS2013(Visual Studio 2013)编译crtmpserver
- 实现一些字符串操作标准库函数、解决一些字符串问题
- CodeForces 732B 之 Cormen — The Best Friend Of a Man
- Spring MVC 入门示例讲解
- PHP 简单的for循环
- leetcode 189: Rotate Array
- 异常摘要
- 安卓中获取手机的相关信息的工具类
- JavaScript中arguments[0]()表示的是什么?
- iOS10相册相机闪退bug
- 【PI应用】用Java查询雅虎天气并解析Json数据