#include <bits/stdc++.h>
using namespace std;
#define int long long
#define size(x) (int)x.size()
#define all(x) x.begin(), x.end()
template<class S, class T>
bool chmin(S& a, const T& b) {
return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S& a, const T& b) {
return a < b ? (a = b) == b : false;
}
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, q; cin >> n >> q;
int a[n + 1];
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
while (q--) {
int l, r, x;
cin >> l >> r >> x;
for (int i = l; i <= r; ++i) {
a[i] += x;
}
vector<int> dp(n + 1, 0);
int max_b = a[1], max_s = -a[1];
for (int i = 2; i <= n; ++i) {
dp[i] = max(max_s + a[i], max_b - a[i]);
chmax(max_s, dp[i - 1] - a[i]);
chmax(max_b, dp[i - 1] + a[i]);
}
cout << dp[n] << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |