Submission #337852

#	Time	Username	Problem	Language	Result	Execution time	Memory
337852		Dilshod_Imomov	Divide and conquer (IZhO14_divide)	C++17	48 / 100	1088 ms	2412 KiB

divide

# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second

using namespace std;

const int N = 1e6 + 7;
const int mod = 1e9 + 7;

int x[N], g[N], d[N], psg[N], psd[N];

int32_t main() {
    speed;
    int n;
    cin >> n;
    for ( int i = 1; i <= n; i++ ) {
        cin >> x[i] >> g[i] >> d[i];
        psg[i] = psg[i - 1] + g[i];
        psd[i] = psd[i - 1] + d[i];
    }
    int ans = 0;
    for ( int i = 1; i <= n; i++ ) {
        for ( int j = i; j > 0; j-- ) {
            if ( x[i] - x[j] <= psd[i] - psd[j - 1] ) {
                ans = max( ans, psg[i] - psg[j - 1] );
            }
        }
    }
    cout << ans;
}

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