Submission #561502

#	Time	Username	Problem	Language	Result	Execution time	Memory
561502		gg123_pe	Divide and conquer (IZhO14_divide)	C++14	48 / 100	1090 ms	3252 KiB

divide

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

typedef long long ll; 
#define f(i,a,b) for(int i = a; i < b; i++)
const int N = 1e5 + 5; 

int n; 
ll a[N], g[N], e[N], sg[N], se[N], ans; 

int main(){
    cin >> n;

    f(i,1,n+1) {
        cin >> a[i] >> g[i] >> e[i]; 
        sg[i] = sg[i-1] + g[i]; 
        se[i] = se[i-1] + e[i]; 
    }

    f(i,1,n+1){
        f(j,i,n+1){
            if(se[j]-se[i-1] >= a[j]-a[i]){
                ans = max(ans, sg[j]-sg[i-1]);
            }
        }
    }
    cout << ans << "\n"; 
    return 0; 
}

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