#include <algorithm>
#include <iostream>
using namespace std;
const int N = 200000;
long long aa[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
int n, q, s, t; cin >> n >> q >> s >> t >> aa[0];
for (int i = 0; i < n; i++)
cin >> aa[i];
for (int i = n - 1; i; i--)
aa[i] -= aa[i - 1];
long long ans = 0;
for (int i = 0; i < n; i++)
ans -= aa[i] * (aa[i] > 0 ? s : t);
while (q--) {
int l, r, a; cin >> l >> r >> a, l--;
ans += aa[l] * (aa[l] > 0 ? s : t);
aa[l] += a;
ans -= aa[l] * (aa[l] > 0 ? s : t);
if (r < n) {
ans += aa[r] * (aa[r] > 0 ? s : t);
aa[r] -= a;
ans -= aa[r] * (aa[r] > 0 ? s : t);
}
cout << ans << '\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |