#include <bits/stdc++.h>
#define pb push_back
#define all(v) v.begin() , v.end()
#define pii pair<int , int>
using namespace std;
const long long inf = 1e18;
void Yusiff(){
    int n , q , s , t , ans = 0; cin >> n >> q >> s >> t;
    int a0; cin >> a0;
    int a[n];
    vector<long long> v;
    v.pb(0);
    for(int i = 0; i < n; i++){
        cin >> a[i];
        v.pb(a[i]);
    }
    while(q--){
        int l , r , k; cin >> l >> r >> k;
        for(int i = l; i <= r; i++){
            v[i] += k;
        }
        int sum = 0 , sum1 = 0;
        vector<int> f , ss;
        for(int i = 0; i < v.size() - 1; ++i){
            if(v[i] < v[i + 1]){
                sum += v[i + 1] - v[i];
                ans -= (v[i + 1] - v[i]) * s;
                f.pb(sum);
            } else{
                sum1 += v[i] - v[i + 1];
                ans += (v[i] - v[i + 1]) * t;
                ss.pb(sum1);
            }
        }
         cout << ans << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        Yusiff();
    }
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |