Submission #1066307

#	Time	Username	Problem	Language	Result	Execution time	Memory
1066307		Malix	Divide and conquer (IZhO14_divide)	C++14	100 / 100	72 ms	3560 KiB

divide

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int main() {   
    int n;cin>>n;
    vector<ll> x(n+1),g(n+1),e(n+1),arr(n+1);
    x[0]=0;e[0]=0;g[0]=0;
    REP(i,1,n+1){
        cin>>x[i]>>g[i]>>e[i];
        g[i]+=g[i-1];
        e[i]+=e[i-1];
        arr[i]=e[i]-x[i];
    }
    for(int i=n-1;i>=0;i--)arr[i]=max(arr[i],arr[i+1]);
    ll ans=0;
    REP(i,1,n+1){
        int  l=i,r=n;
        while(l<r){
            int m=(l+r)/2;
            if(arr[m+1]+x[i]-e[i-1]>=0)l=m+1;
            else r=m;
        }
        ans=max(ans,g[l]-g[i-1]);
    }
    cout<<ans;
}

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