제출 #985842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
985842		LOLOLO	Sjeckanje (COCI21_sjeckanje)	C++17	55 / 110	30 ms	616 KiB

Main

#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 3e3 + 10;
ll a[N], b[N], f[N][2];
ll cal(int n) {
    for (int i = 2; i <= n; i++) {
        f[i][0] = max(f[i - 1][0], f[i - 1][1]);
        if (a[i] * a[i - 1] >= 0) {
            f[i][1] = max(f[i - 1][0], f[i - 1][1]) + abs(a[i]);
        } else {
            f[i][1] = f[i - 1][0] + abs(a[i]);
        }
    }

    return max(f[n][0], f[n][1]);
}
                                                                                     
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, q;
    cin >> n >> q;

    for (int i = 1; i <= n; i++) {
        cin >> b[i];
        a[i] = b[i] - b[i - 1];
    }

    for (int i = 0; i < q; i++) {
        int l, r, x;
        cin >> l >> r >> x;
        a[l] += x;
        a[r + 1] -= x;

        cout << cal(n) << '\n';
    }

    return 0;
} 

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