Submission #372947

#	Time	Username	Problem	Language	Result	Execution time	Memory
372947		arujbansal	Sjeckanje (COCI21_sjeckanje)	C++17	55 / 110	2045 ms	5832 KiB

Main

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <array>
#include <stack>
#include <queue>
#include <random>
#include <numeric>
#include <functional>
#include <chrono>
#include <utility>
#include <iomanip>
#include <assert.h>

using namespace std;

void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)

#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rng_seed(x) mt19937 rng(x)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define int long long

const int MXN = 1e5 + 5, INF = 1e16;

void solve() {
    int N, Q;
    cin >> N >> Q;

    vector<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 mx = -INF, mn = INF;

        for (int i = 1; i <= N; i++) {
            mx = max(mx, dp[i - 1] + A[i]);
            mn = min(mn, - dp[i - 1] + A[i]);

            dp[i] = max(dp[i], mx - A[i]);
            dp[i] = max(dp[i], A[i] - mn);

            dp[i] = max(dp[i], dp[i - 1]);
        }

        cout << dp[N] << "\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int TC = 1;
    // cin >> TC;
    while (TC--) solve();
}

• Subtask 1: 15 / 15
• Subtask 2: 40 / 40
• Subtask 3: 0 / 55