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 <cmath>

using namespace std;



int main(){
	int n, m;
	cin >> n >> m;
	long long tab[200000];
	
	for(int i = 0; i < n; i++){
		cin >> tab[i];
	}
	
	for(int j = 0; j < m; j++){
		long long d;
		cin >> d;
		
		long long last = 0;
		long long result = 0;
		
		for(int i = 0; i < n; i++){
			long long diff = tab[i] - last;
			
			if(diff < d){
				last = tab[i]+(d-diff);
				result += (d-diff);
			}
			else{
				last=tab[i];
			}
		}
		
		cout << result << '\n';
	}
	return 0;
}