1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
#include <iostream>
#include <algorithm>

using namespace std;
typedef long long LL;

LL t[200000];

int main()
{
    ios_base::sync_with_stdio(false);
    int n, m;
    cin>>n>>m;
    for (int i=0; i<n; ++i)
        cin>>t[i];
    for (int i=0; i<m; ++i)
    {
        int d;
        cin>>d;
        LL wyn=0, k=0;
        for (int j=0; j<n; ++j)
        {
            k=max(k+d, t[j]);
            wyn+=k-t[j];
        }
        cout<<wyn<<'\n';
    }
    return 0;
}