#include <bits/stdc++.h> #define FOR(i,b,e) for(int i=(b); i <= (e); ++i) #define FORD(i,b,e) for(int i=(b); i >= (e); --i) #define SIZE(c) (int) (c).size() #define FORE(i,c) FOR(i,0,SIZE(c)-1) #define FORDE(i,c) FORD(i,SIZE(c)-1,0) #define pb push_back #define mp make_pair #define st first #define nd second using namespace std; typedef long long ll; typedef pair <int,int> pii; typedef pair <ll,ll> pll; typedef vector <int> VI; typedef vector <bool> VB; typedef vector <pii> VP; typedef vector <ll> VL; typedef vector <pll> VPL; typedef vector <VI> VVI; typedef vector <VL> VVL; typedef vector <VB> VVB; typedef vector <VP> VVP; /*************************************************************************/ const int CHECK = 0; const int QUERY = 1; struct event { int type, i; ll d; bool operator<(const event &other) const { return make_tuple(d, type, i) > make_tuple(other.d, other.type, other.i); } }; /*************************************************************************/ int main() { ios_base::sync_with_stdio(0); int n, m; cin >> n >> m; n++; VL t(n, 0); FOR(i,1,n-1) { cin >> t[i]; } VL tPref = t; FOR(i,1,n-1) { tPref[i] += tPref[i-1]; } VL ans(m,-1); priority_queue <event> events; FOR(i,0,m-1) { int d; cin >> d; events.push({QUERY, i, d}); } auto addEvent = [&](int i, int j) { int len = j - i; ll d = (t[j] - t[i] + len - 1) / len; events.push({CHECK, i, d}); }; ll ansTotal = 0; ll dTotal = 0; auto updateForBlock = [&](int l, int r, int chg) { int len = r - l + 1; ansTotal += chg * len * t[l]; ansTotal -= chg * (tPref[r] - (l ? tPref[l-1] : 0)); dTotal += (ll) chg * len * (len - 1) / 2; }; FOR(i,0,n-2) { addEvent(i, i + 1); } set <pii> blocks; FOR(i,0,n-1) { blocks.insert({i, i}); } while (!events.empty()) { auto e = events.top(); events.pop(); if (e.type == CHECK) { auto it = blocks.lower_bound({e.i, -1}); if (it != blocks.end() && it->st == e.i) { auto itNext = next(it); if (itNext != blocks.end()) { int iNext, jNext; tie(iNext, jNext) = *itNext; if (t[iNext] <= t[e.i] + (iNext - e.i) * e.d) { updateForBlock(it->st, it->nd, -1); updateForBlock(itNext->st, itNext->nd, -1); updateForBlock(e.i, jNext, 1); blocks.erase(it); blocks.erase(itNext); blocks.insert({e.i, jNext}); if (jNext < n - 1) { addEvent(e.i, jNext + 1); } } } } } else { ans[e.i] = ansTotal + dTotal * e.d; } } for (ll x : ans) { cout << x << '\n'; } return 0; } /*************************************************************************/
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 | #include <bits/stdc++.h> #define FOR(i,b,e) for(int i=(b); i <= (e); ++i) #define FORD(i,b,e) for(int i=(b); i >= (e); --i) #define SIZE(c) (int) (c).size() #define FORE(i,c) FOR(i,0,SIZE(c)-1) #define FORDE(i,c) FORD(i,SIZE(c)-1,0) #define pb push_back #define mp make_pair #define st first #define nd second using namespace std; typedef long long ll; typedef pair <int,int> pii; typedef pair <ll,ll> pll; typedef vector <int> VI; typedef vector <bool> VB; typedef vector <pii> VP; typedef vector <ll> VL; typedef vector <pll> VPL; typedef vector <VI> VVI; typedef vector <VL> VVL; typedef vector <VB> VVB; typedef vector <VP> VVP; /*************************************************************************/ const int CHECK = 0; const int QUERY = 1; struct event { int type, i; ll d; bool operator<(const event &other) const { return make_tuple(d, type, i) > make_tuple(other.d, other.type, other.i); } }; /*************************************************************************/ int main() { ios_base::sync_with_stdio(0); int n, m; cin >> n >> m; n++; VL t(n, 0); FOR(i,1,n-1) { cin >> t[i]; } VL tPref = t; FOR(i,1,n-1) { tPref[i] += tPref[i-1]; } VL ans(m,-1); priority_queue <event> events; FOR(i,0,m-1) { int d; cin >> d; events.push({QUERY, i, d}); } auto addEvent = [&](int i, int j) { int len = j - i; ll d = (t[j] - t[i] + len - 1) / len; events.push({CHECK, i, d}); }; ll ansTotal = 0; ll dTotal = 0; auto updateForBlock = [&](int l, int r, int chg) { int len = r - l + 1; ansTotal += chg * len * t[l]; ansTotal -= chg * (tPref[r] - (l ? tPref[l-1] : 0)); dTotal += (ll) chg * len * (len - 1) / 2; }; FOR(i,0,n-2) { addEvent(i, i + 1); } set <pii> blocks; FOR(i,0,n-1) { blocks.insert({i, i}); } while (!events.empty()) { auto e = events.top(); events.pop(); if (e.type == CHECK) { auto it = blocks.lower_bound({e.i, -1}); if (it != blocks.end() && it->st == e.i) { auto itNext = next(it); if (itNext != blocks.end()) { int iNext, jNext; tie(iNext, jNext) = *itNext; if (t[iNext] <= t[e.i] + (iNext - e.i) * e.d) { updateForBlock(it->st, it->nd, -1); updateForBlock(itNext->st, itNext->nd, -1); updateForBlock(e.i, jNext, 1); blocks.erase(it); blocks.erase(itNext); blocks.insert({e.i, jNext}); if (jNext < n - 1) { addEvent(e.i, jNext + 1); } } } } } else { ans[e.i] = ansTotal + dTotal * e.d; } } for (ll x : ans) { cout << x << '\n'; } return 0; } /*************************************************************************/ |