Submission #741982

#	Time	Username	Problem	Language	Result	Execution time	Memory
741982		BidoTeima	Divide and conquer (IZhO14_divide)	C++17	0 / 100	1 ms	212 KiB

divide

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <fstream>
#include <string>
#include <random>
#include <chrono>
#include <memory.h>
using namespace std;
using ll = long long;

int main()
{         
    int n;
    cin>>n;
    set<pair<ll, ll>>st;
    ll gold = 0, energy = 0, ans = 0;
    for(int i = 0; i < n; i++){
        int x,g,d;
        cin>>x>>g>>d;
        st.insert(make_pair(x - energy, gold));
        gold += g, energy += d;
        auto it = st.lower_bound(make_pair(x - energy, 0ll));
        if(it != st.end()){
            ans = max(ans, gold - it->second);
        } 
    }
    cout<<ans<<'\n';
    return 0;
}

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