#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }
inline void solve() {
int n, q;
cin >> n >> q;
ve<ll> a(n);
for (auto &i : a) cin >> i;
while (q--) {
int l, r, x;
cin >> l >> r >> x;
for (int i = l - 1; i < r; ++i) a[i] += x;
ll ans = 0;
if (n & 1 ^ 1) {
for (int i = 1; i < n; ++++i) {
ans += max(a[i], a[i - 1]) - min(a[i], a[i - 1]);
}
}
else {
for (int pos = 0; pos + 2 < n; ++++pos) {
ll res = max({a[pos], a[pos + 1], a[pos + 2]}) -
min({a[pos], a[pos + 1], a[pos + 2]});
for (int i = 1; i < pos; ++++i) res += max(a[i], a[i - 1]) - min(a[i], a[i - 1]);
for (int i = pos + 4; i < n; ++++i) res += max(a[i], a[i - 1]) - min(a[i], a[i - 1]);
chmax(ans, res);
}
}
cout << ans << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int q = 1; // cin >> q;
while (q--) solve();
cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}
Compilation message
Main.cpp: In function 'void solve()':
Main.cpp:36:9: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
36 | if (n & 1 ^ 1) {
| ~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
328 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
328 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
328 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
