제출 #902462

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
902462		VMaksimoski008	Election (BOI18_election)	C++17	100 / 100	607 ms	77768 KiB

election

#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

struct Node {
    ll sum, ans, pref, suf;
};

struct SegTree {
    int n;
    vector<Node> tree;
    vector<int> v;

    SegTree(vector<int> _v) {
        v = _v;
        n = sz(v);
        tree.resize(4*n+5);
        build(1, 0, n-1);
    }

    Node merge(Node a, Node b) {
        Node res;

        res.sum = a.sum + b.sum;
        res.pref = max({ 0ll, a.pref, a.sum + b.pref });
        res.suf = max({ 0ll, b.suf, b.sum + a.suf });
        res.ans = max({ a.pref + b.suf, a.ans + b.sum, a.sum + b.ans });

        return res;
    }

    void build(int u, int tl, int tr) {
        if(tl == tr) {
            tree[u].ans = max(v[tl], 0);
            tree[u].sum = v[tl];
            tree[u].pref = tree[u].suf = max(v[tl], 0);
        } else {
            int tm = (tl + tr) / 2;
            build(2*u, tl, tm);
            build(2*u+1, tm+1, tr);
            tree[u] = merge(tree[2*u], tree[2*u+1]);
        }
    }

    Node query(int u, int tl, int tr, int l, int r) {
        if(tl > tr || tl > r || l > tr) return Node{0, 0, 0, 0};
        if(l <= tl && tr <= r) return tree[u];
        int tm = (tl + tr) / 2;
        return merge(
            query(2*u, tl, tm, l, r),
            query(2*u+1, tm+1, tr, l, r)
        );
    }

    ll query(int l, int r) {
        return query(1, 0, n-1, l, r).ans;
    }
};

int32_t main() {
    setIO();

    int n;
    cin >> n;

    vector<int> v(n);
    for(int i=0; i<n; i++) {
        char ch;
        cin >> ch;
        v[i] = (ch == 'T' ? 1 : -1);
    }

    SegTree tree(v);
    
    int q;
    cin >> q;

    while(q--) {
        int l, r;
        cin >> l >> r;
        cout << tree.query(l-1, r-1) << '\n';
    }

    return 0;
}

• Subtask 1: 28 / 28
• Subtask 2: 54 / 54
• Subtask 3: 18 / 18