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
44
45
46
47
48
49
50
51
52
53
54
55
#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;
using LL = long long;

int main()
{
	int n, m, d;
	LL t;
	vector<LL> T;

	LL prev = 0;
	LL border = 10000000;

	cin >> n >> m;

	for (int i = 0; i < n; i++)
	{
		cin >> t;
		T.push_back(t);
		border = min(border, t - prev);
		prev = t;
	}

	for (int i = 0; i < m; i++)
	{
		cin >> d;

		if (d <= border)
		{
			cout << 0 << endl;
		}
		else
		{
			LL res = 0;
			LL cum = 0;

			for (int i = 0; i < n; i++)
			{
				cum += d;

				if (cum > T[i])
					res += cum - T[i];
				else
					cum = T[i];
			}

			cout << res << endl;
		}
	}

	return 0;
}