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
40
41
42
43
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 2 * 1e5;
long long t[N + 1];
int n, q;

long long answer(long long d) {
    long long result = 0LL;

    long long lastPos = 0LL;
    for(int i = 0; i < n; ++i) {
        long long Time = t[i];
        long long nextPos = max(lastPos, Time - d) + d;
        result += nextPos - Time;
        lastPos = nextPos;
    }

    return result;
}

void read() {
    scanf("%d%d", &n, &q);
    for(int i = 0; i < n; ++i) {
        scanf("%lld", &t[i]);
    }
}

void solve() {
    for(int i = 0; i < q; ++i) {
        long long d;
        scanf("%lld", &d);
        printf("%lld\n", answer(d));
    }
}

int main()
{
    read();
    solve();
    return 0;
}