Submission #571138

#	Time	Username	Problem	Language	Result	Execution time	Memory
571138		stevancv	Art Exhibition (JOI18_art)	C++14	0 / 100	1 ms	212 KiB

art

#include <bits/stdc++.h>
//#include "molecules.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 5e5 + 2;
const int M = 1e9;
int mod = 1000000007;
ll st[4 * N];
void Set(int node, int l, int r, int x, ll y) {
    if (l == r) {st[node] = y; return;}
    int mid = l + r >> 1;
    if (x <= mid) Set(2 * node, l, mid, x, y);
    else Set(2 * node + 1, mid + 1, r, x, y);
    st[node] = max(st[2 * node], st[2 * node + 1]);
}
ll Get(int node, int l, int r, int ql, int qr) {
    if (r < ql || qr < l) return 0;
    if (ql <= l && r <= qr) return st[node];
    int mid = l + r >> 1;
    return max(Get(2 * node, l, mid, ql, qr), Get(2 * node + 1, mid + 1, r, ql, qr));
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    vector<ll> a(n), b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
    }
    vector<int> order(n);
    iota(order.begin(), order.end(), 0);
    sort(order.begin(), order.end(), [&] (int i, int j) {
        return a[i] < a[j];
    });
    for (int i = n - 2; i >= 0; i--) b[i] += b[i + 1];
    for (int i = 0; i < n; i++) Set(1, 0, n - 1, i, a[i] + b[i]);
    ll ans = 0;
    for (int i = n - 1; i >= 0; i--) {
        ll x = Get(1, 0, n - 1, 0, i);
        if (i == n - 1) smax(ans, x - a[i]);
        else smax(ans, x - a[i] - b[i]);
    }
    cout << ans << en;
    return 0;
}

Compilation message (stderr)

art.cpp: In function 'void Set(int, int, int, int, long long int)':
art.cpp:16:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   16 |     int mid = l + r >> 1;
      |               ~~^~~
art.cpp: In function 'long long int Get(int, int, int, int, int)':
art.cpp:24:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |     int mid = l + r >> 1;
      |               ~~^~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50