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.
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.
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.
3 5 2 0 1
4 2 3 2
3 1 0 0 0
1 0 1 0
4 6 2 4 3 5
0 2 4 3 5
问题:就是给定一个遛狗任务...要求两天的遛狗时间和超过给定的就行...n是天数,k是遛狗任务,呢个数列是他内心想去遛狗的时间...现在就是要把他内心想的时间加长到
满足k值就行...最后输出 实际需要的时间比他内心想的多多少和实际最短的遛狗时间...好水的题啊居然标签是DP...
分析:++--就行...不能再简单...
#include<iostream>
using namespace std;
int main(){
int n,k,a[505],sum=0;
cin>>n>>k;
for(int i=0;i<n;i++) cin>>a[i];
for(int j=0;j<n-1;j++){
if(k-a[j]>a[j+1]){
sum+=k-a[j]-a[j+1];
a[j+1]=k-a[j];
}
}
cout<<sum<<endl;
for(int i=0;i<n-1;i++){
cout<<a[i]<<" ";
}
cout<<a[n-1]<<endl;
return 0;
}