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
30
31
32
33
34
35
36
37
38
39
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;

const int roz = 1e6 + 10;
ll t[roz];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, i, j;
    cin>>n>>m;

    for(i = 1; i <= n; i++)
        cin>>t[i];

    for(i = 1; i <= m; i++)
    {
        ll d;
        cin>>d;

        ll pop = 0;
        ll odp = 0;

        for(j = 1; j <= n; j++)
        {
            if(t[j] - pop >= d)
                pop = t[j];
            else
                pop = pop + d;
            odp += pop - t[j];
        }

        cout<<odp<<"\n";
    }
}