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
//Zapiekanki 2
#include <iostream>
#include <algorithm>
#define MAXLEN 200001

using namespace std;

int n, m;
long long d;
long long t[MAXLEN];
long long o[MAXLEN];

int main() {
    ios_base::sync_with_stdio(0);
    cin >> n >> m;
    for(int i = 0; i < n; i++){
        cin >> t[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> d;
        unsigned long long sumT = 0;
        o[0] = max(t[0], d);
        sumT += (o[0] - t[0]);
        for (int j = 1; j < n; j++) {
            o[j] = max(o[j - 1] + d, t[j]);
            sumT += (o[j] - t[j]);
        }
        cout << sumT << endl;
    }
    
    return 0;
}