CodeForces 732B Cormen --- The Best Friend Of a Man

Posted 2020-08-31

模拟。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<ctime>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-10;
void File()
{
    freopen("D:\\in.txt","r",stdin);
    freopen("D:\\out.txt","w",stdout);
}
template <class T>
inline void read(T &x)
{
    char c = getchar();
    x = 0;
    while(!isdigit(c)) c = getchar();
    while(isdigit(c))
    {
        x = x * 10 + c - ‘0‘;
        c = getchar();
    }
}

int n,k;
int a[600],b[600];

int main()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++) cin>>a[i];
    int sum=0;
    b[1]=a[1];
    for(int i=2;i<=n;i++)
    {
        b[i]=a[i];
        if(b[i-1]+b[i]>=k) continue;
        sum=sum+k-(b[i-1]+b[i]);
        b[i]+=k-(b[i-1]+b[i]);
    }
    cout<<sum<<endl;
    for(int i=1;i<=n;i++) cout<<b[i]<<" ";
    cout<<endl;

    return 0;
}