Submission #626933

#	Time	Username	Problem	Language	Result	Execution time	Memory
626933		BackNoob	Sjeckanje (COCI21_sjeckanje)	C++14	0 / 110	2 ms	420 KiB

Main

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
 
int n;
int q;
ll a[mxN];
 
void solve()
{
	cin >> n >> q;
	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;

		ll res = 0;
		multiset<ll> ms;
		for(int i = 1; i <= n; i++) {
			if(sz(ms) == 0) ms.insert(a[i]);
			else {
				ll lef = *ms.begin();
				ll rig = *--ms.end();

				if(a[i] < lef || rig < a[i]) {
					ms.insert(a[i]);
				}
				else {
					res += rig - lef;
					ms.clear();
					ms.insert(a[i]);
				}
			}
		}
		if(sz(ms) > 0) {
			ll lef = *ms.begin();
			ll rig = *--ms.end();
			res += (rig - lef);
		}
		cout << res << endl;
	}
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

 
    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

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