제출 #917629

#제출 시각아이디문제언어결과실행 시간메모리
917629Whisper금 캐기 (IZhO14_divide)C++17
48 / 100
1098 ms4676 KiB
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
struct Data{
    int x, g, d;
    friend istream& operator >> (istream& cin, Data& a){
        cin >> a.x >> a.g >> a.d;
        return cin;
    }
    friend ostream& operator << (ostream& cout, Data a){
        cout << a.x << " " << a.g << " " << a.d;
        return cout;
    }
};
int N;

int G[MAX], D[MAX];
int dp[MAX];
Data a[MAX];
void Whisper(){
    cin >> N;
    for (int i = 1; i <= N; ++i) cin >> a[i];
    // tìm đoạn con liên tiếp sao cho tổng d(i) >= độ dài và tổng g(i) là lớn nhất
    for (int i = 1; i <= N; ++i){
        G[i] = G[i - 1] + a[i].g;
        D[i] = D[i - 1] + a[i].d;
    }
    for (int i = 1; i <= N; ++i){
        for (int j = 1; j <= i; ++j){
            if (D[i] - D[j - 1] >= (a[i].x - a[j].x)){
                dp[i] = max(dp[i], G[i] - G[j - 1]);
            }
        }
    }
    int ans = 0;
    FOR(i, 1, N) maximize(ans, dp[i]);
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...