#include <bits/stdc++.h>
#define dbg() cerr <<
#define name(x) (#x) << ": " << (x) << ' ' <<
using namespace std;
template<class T, class Container = vector<T>, class Compare = less<T>>
struct PriorityQueue {
int sz = 0;
priority_queue<T, Container, Compare> pq, del;
void emplace(const T &val) { pq.emplace(val); ++sz; }
void erase(const T &val) { del.emplace(val); --sz; }
void pop() { erase(top()); }
T top() {
while (!del.empty() && !pq.empty() && del.top() == pq.top()) del.pop(), pq.pop();
return pq.top();
}
int size() const {return sz;}
};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
PriorityQueue<tuple<int, int, int>> interv;
for (int i = 0; i < n; ++i) {
interv.emplace(make_tuple(v[i], i, i));
}
vector<int> lft(n), rgt(n), val(n);
for (int i = 0; i < n; ++i) {
lft[i] = i;
rgt[i] = i;
val[i] = v[i];
}
int64_t ans = 0;
for (int k = 1; k <= (n + 1) / 2; ++k) {
int curr, l, r; tie(curr, l, r) = interv.top(); interv.pop();
ans += curr;
cout << ans << '\n';
curr = -curr;
int nl = l, nr = r;
if (l - 1 >= 0) {
int x = lft[l - 1], y = l - 1;
interv.erase(make_tuple(val[x], x, y));
curr += val[x];
nl = x;
}
if (r + 1 < n) {
int x = r + 1, y = rgt[x];
interv.erase(make_tuple(val[x], x, y));
curr += val[x];
nr = y;
}
interv.emplace(make_tuple(curr, nl, nr));
val[nl] = curr;
lft[nr] = nl;
rgt[nl] = nr;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
