Submission #1240223

#	Time	Username	Problem	Language	Result	Execution time	Memory
1240223		ssitaram	Sjeckanje (COCI21_sjeckanje)	C++20	0 / 110	0 ms	320 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	ll smabs = 0, smc = 0;
	vector<ll> D(n - 1);
	vector<int> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
		if (i > 0) {
			D[i - 1] = a[i] - a[i - 1];
			smabs += abs(D[i - 1]);
		}
	}
	auto junct = [&](int i) -> ll {
		if (i >= n - 2 || i < 0) return 0;
		if ((D[i] > 0 && D[i + 1] < 0) || (D[i] < 0 && D[i + 1] > 0)) return min(abs(D[i]), abs(D[i + 1]));
		return 0;
	};
	for (int i = 0; i < n - 2; ++i) {
		smc += junct(i);
	}
	auto add = [&](int i, int x) -> void {
		if (i < 0 || i >= n - 1) return;
		smc -= junct(i - 1);
		smc -= junct(i);
		smabs -= abs(D[i]);
		D[i] += x;
		smabs += abs(D[i]);
		smc += junct(i - 1);
		smc += junct(i);
	};
	while (q--) {
		int l, r, x; cin >> l >> r >> x;
		--l; --r;
		add(l - 1, x);
		add(r, -x);
		cout << smabs - smc << '\n';
	}
	return 0;
}

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