제출 #1202737

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1202737		TahirAliyev	금 캐기 (IZhO14_divide)	C++20	100 / 100	43 ms	4288 KiB

divide

#include <bits/stdc++.h>

#define int long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
const int oo = 1e18 + 9;
const int MAX = 4e5 + 5, LOGMAX = 20, B = 441, MOD = 1e9 + 7;

int n;
array<int, 3> arr[MAX];
int ans = 0;
void dc(int l, int r){
    if(l == r) {ans = max(ans, arr[l][1]);return;}
    int mid = (l + r) / 2;
    vector<pii> v;
    for(int i = mid + 1, e = arr[i][2], g = arr[i][1]; i <= r; i++, e += arr[i][2], g += arr[i][1]) v.push_back({-(arr[i][0] - arr[mid][0]) + e, g});
    sort(all(v));
    for(int i = v.size() - 2; i >= 0; i--) v[i].second = max(v[i].second, v[i + 1].second);
    for(int i = mid, e = arr[i][2], g = arr[i][1]; i >= l; i--, e += arr[i][2], g += arr[i][1]){
        auto itr = lower_bound(all(v), make_pair(-(e - (arr[mid][0] - arr[i][0])), -oo));
        if(itr != v.end()) ans = max(ans, itr->second + g);
    }
    dc(l, mid), dc(mid + 1, r);
}

void solve(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
    }
    dc(1, n);
    cout << ans << '\n';
}   

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
}

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 52 / 52