Submission #488878

#	Time	Username	Problem	Language	Result	Execution time	Memory
488878		SirCovidThe19th	Divide and conquer (IZhO14_divide)	C++17	100 / 100	130 ms	5268 KiB

divide

#include <bits/stdc++.h>
using namespace std;

const int mx = 1e5 + 5;

int n, X[mx]; long long G[mx], E[mx], pre[mx], ans; 

int main(){
    cin >> n; 
    for (int i = 1; i <= n; i++){
        cin >> X[i] >> G[i] >> E[i]; 
        G[i] += G[i - 1]; E[i] += E[i - 1];
        pre[i] = min(pre[i - 1], E[i - 1] - X[i]);
    }
    for (int i = 1; i <= n; i++){
        int L = 1, H = i;
        while (L < H){
            int M = (L + H) / 2;
            (pre[M] <= E[i] - X[i]) ? H = M : L = M + 1;
        }
        ans = max(ans, G[i] - G[L - 1]);
    }
    cout<<ans<<endl;
}

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