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
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;

int main()
{
    ios_base::sync_with_stdio(0);
    int n, m;
    cin >> n >> m;
    vector<ll> t(n);
    for (int i = 0; i < n; ++i)
        cin >> t[i];
    for (int i = 0; i < m; ++i)
    {
        int d;
        cin >> d;
        ll odp = 0;
        ll ost = -1;
        for (int j = 0; j < n; ++j)
        {
            if (t[j] - d > ost)
                ost = t[j] - 1;
            else
            {
                odp += ost - (t[j] - d) + 1;
                ost += d;
            }
        }
        cout << odp << endl;
    }
    return 0;
}