제출 #1152604

#제출 시각아이디문제언어결과실행 시간메모리
1152604gelastropodSjeckanje (COCI21_sjeckanje)C++20
0 / 110
5 ms320 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
	int n, q, x, l, r;
	cin >> n >> q;
	vector<int> A;
	for (int i = 0; i < n; i++) {
		cin >> x;
		A.push_back(x);
	}
	for (int i = 0; i < q; i++) {
		cin >> l >> r >> x;
		l--, r--;
		for (int j = l; j <= r; j++)
			A[j] += x;
		vector<int> dp;
		dp.push_back(0);
		for (int j = 0; j < n; j++) {
			int crntmax = -1;
			int cmin = A[j], cmax = j;
			for (int k = j; k >= 0; k--) {
				cmax = max(cmax, A[k]);
				cmin = min(cmin, A[k]);
				crntmax = max(crntmax, dp[k] + cmax - cmin);
			}
			dp.push_back(crntmax);
		}
		cout << dp.back() << '\n';
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...