#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int N, Q;
vector<ll> a;
void update(int l, int r, ll k){
rep(i, l, r + 1) a[i] += k;
}
ll get(){
if(N == 1) return 0;
if(N == 2) return abs(a[0] - a[1]);
vector<ll> dp(N + 1, 0);
dp[0] = dp[1] = 0;
dp[2] = abs(a[0] - a[1]);
rep(i, 3, N + 1){
dp[i] = max({dp[i - 1], dp[i - 3] + abs(a[i - 3] - a[i - 1]), dp[i - 2] + abs(a[i - 2] - a[i - 1])});
}
return dp[N];
}
void solve(){
cin >> N >> Q;
a = vector<ll>(N);
rep(i, 0, N) cin >> a[i];
rep(q, 0, Q){
int l, r; ll k;
cin >> l >> r >> k;
--l, --r;
update(l, r, k);
cout << get() << "\n";
}
}
int main(){
ios_base::sync_with_stdio(false), cin.tie(nullptr);
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
