# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369821 | Sorting | Election (BOI18_election) | C++17 | 570 ms | 28096 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 3;
int n, q;
string s;
struct Segment_Tree{
struct Node{
int prefix, suffix, sum, ans;
Node(){}
Node(int x): prefix(max(x, 0)), suffix(max(x, 0)), ans(max(x, 0)), sum(x){}
friend Node merge(Node l, Node r){
Node ret;
ret.sum = l.sum + r.sum;
ret.prefix = max(l.prefix, r.prefix + l.sum);
ret.suffix = max(r.suffix, l.suffix + r.sum);
ret.ans = max(max(l.ans + r.sum, r.ans + l.sum), l.prefix + r.suffix);
return ret;
}
};
Node nd[4 * N];
void init(int i = 0, int l = 0, int r = n - 1){
if(l == r){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |