# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1100555 | vjudge1 | Election (BOI18_election) | C++17 | 187 ms | 39500 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;
typedef long long int ll;
const int MAXN = 3e5 + 10;
char c[MAXN];
struct Segment {
struct Node {
int pf, sf, sum, ans;
Node()
{
pf = sf = sum = ans = 0;
}
} node[MAXN << 2];
Node merge(Node l, Node r)
{
Node res;
res.pf = max(l.pf, l.sum + r.pf);
res.sf = max(r.sf, r.sum + l.sf);
res.sum = l.sum + r.sum;
res.ans = max(max(l.ans + r.sum, r.ans + l.sum), l.pf + r.sf);
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |