이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "holiday.h"
#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
const int N = 3e5 + 5, INF = 2e9;
int n, d, start, a[N], ori[N], sz; long long ans = -INF;
vector<int> val;
struct node{
int cnt, l, r; long long sum;
node(){
l = r = 0, cnt = sum = 0;
}
};
vector<node> nodes;
int root[N];
int build(int l, int r){
int id = nodes.size();
nodes.push_back(node());
if(l == r){
return id;
}
int mid = (l + r) / 2;
nodes[id].l = build(l, mid);
nodes[id].r = build(mid + 1, r);
return id;
}
int upd(int k, int tl, int tr, int i, int x){
int id = nodes.size();
nodes.push_back(node());
if(tl == tr){
nodes[id].cnt = nodes[k].cnt + 1;
nodes[id].sum = nodes[k].sum + ori[tl];
return id;
}
int mid = (tl + tr) / 2;
if(i <= mid){
nodes[id].l = upd(nodes[k].l, tl, mid, i, x);
nodes[id].r = nodes[k].r;
} else{
nodes[id].l = nodes[k].l;
nodes[id].r = upd(nodes[k].r, mid + 1, tr, i, x);
}
nodes[id].cnt = nodes[nodes[id].l].cnt + nodes[nodes[id].r].cnt;
nodes[id].sum = nodes[nodes[id].l].sum + nodes[nodes[id].r].sum;
return id;
}
long long query(int l, int r, int tl, int tr, int k){
if(tl == tr){
return 1LL * ori[tl] * min(k, nodes[r].cnt - nodes[l].cnt);
}
int mid = (tl + tr) / 2;
if(nodes[nodes[r].r].cnt - nodes[nodes[l].r].cnt >= k){
return query(nodes[l].r, nodes[r].r, mid + 1, tr, k);
} else{
// cout << ori[mid + 1] << " " << r -> r -> cnt - l -> r -> cnt << " " << r -> r -> sum - l -> r -> sum << endl;
return nodes[nodes[r].r].sum - nodes[nodes[l].r].sum + query(nodes[l].l, nodes[r].l, tl, mid, k - (nodes[nodes[r].r].cnt - nodes[nodes[l].r].cnt));
}
}
long long cost(int l, int start, int r){
int queryop = min(d - (r - l + min(r - start, start - l)), r - l + 1);
if(queryop < 0) return -INF;
// cout << l << ' ' << start << " " << r << ' ' << queryop << " " << query(root[l - 1], root[r], 0, sz, queryop)<< endl;
return query(root[l - 1], root[r], 0, sz, queryop);
}
void dnc(int l, int r, int optl, int optr){
if(l > r) return;
int mid = (l + r) / 2;
pair<long long, int> best = {-INF, 0};
for(int i = optl; i <= min(optr, mid); i++){
best = max(best, {cost(i, start, mid), i});
}
ans = max(ans, best.first);
dnc(l, mid - 1, optl, best.second);
dnc(mid + 1, r, best.second, optr);
}
long long int findMaxAttraction(int nn, int startt, int dd, int attraction[]){
n = nn, start = startt, d = dd;
start++;
for(int i = 0; i < n; i++){
a[i + 1] = attraction[i];
}
for(int i = 1; i <= n; i++) val.push_back(a[i]);
sort(val.begin(), val.end()); val.resize(unique(val.begin(), val.end()) - val.begin());
for(int i = 0; i < (int) val.size(); i++) ori[i] = val[i];
sz = val.size() - 1;
root[0] = build(0, sz);
for(int i = 1; i <= n; i++){
a[i] = lower_bound(val.begin(), val.end(), a[i]) - val.begin();
root[i] = upd(root[i - 1], 0, sz, a[i], 1);
}
dnc(start, n, 1, start);
return ans;
}
// int main() {
// int n, start, d;
// int attraction[100000];
// int i, n_s;
// n_s = scanf("%d %d %d", &n, &start, &d);
// for (i = 0 ; i < n; ++i) {
// n_s = scanf("%d", &attraction[i]);
// }
// printf("%lld\n", findMaxAttraction(n, start, d, attraction));
// return 0;
// }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |