# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1212483 | VMaksimoski008 | Foehn Phenomena (JOI17_foehn_phenomena) | C11 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main() {
ll n, q, s, t, ans = 0;
cin >> n >> q >> s >> t;
vector<ll> a(n+1), d(n+1);
for(int i=0; i<=n; i++) {
cin >> a[i];
if(i > 0) {
d[i] = a[i] - a[i-1];
if(d[i] > 0) ans -= d[i] * s;
else ans += abs(d[i]) * t;
}
}
while(q--) {
int l, r, x; cin >> l >> r >> x;
if(d[l] > 0) ans += d[l] * s;
else ans += d[l] * t;
d[l] += x;
if(d[l] > 0) ans -= d[l] * s;
else ans -= d[l] * t;
if(r != n) {
if(d[r+1] > 0) ans += d[r+1] * s;
else ans += d[r+1] * t;
d[r+1] -= x;
if(d[r+1] > 0) ans -= d[r+1] * s;
else ans -= d[r+1] * t;
}
cout << ans << '\n';
}
}