#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
const ll inf = 1e18;
int n, q;
vector < int > s;
ll pref[maxn];
vector < int > add[maxn], rem[maxn];
vector<int> distribute_candies(vector<int> c, vector<int> l,
vector<int> r, vector<int> v)
{
n = c.size();
q = l.size();
s.resize(n, 0);
for (int i = 0; i < q; i ++)
{
add[l[i]].push_back(i);
rem[r[i]].push_back(i);
}
for (int i = 0; i < n; i ++)
{
pref[0] = inf;
pref[1] = 0;
for (int j = 0; j < q; j ++)
{
pref[j + 2] = pref[j + 1];
if (l[j] <= i && r[j] >= i)
{
///cout << "here" << endl;
pref[j + 2] += v[j];
}
}
/**for (int j = 0; j < q + 2; j ++)
cout << pref[j] << " ";
cout << endl;*/
ll max_height = pref[q + 1];
ll min_height = pref[q + 1];
int last = q + 1;
for (int j = q; j >= 0; j --)
{
max_height = max(max_height, pref[j]);
min_height = min(min_height, pref[j]);
///cout << i << " " << max_height << " " << min_height << endl;
last = j;
if (max_height - min_height > c[i])
break;
}
if (max_height == pref[last])
s[i] = pref[q + 1] - min_height;
else
s[i] = pref[q + 1] - (max_height - c[i]);
}
return s;
}
