제출 #342666

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
342666		apostoldaniel854	금 캐기 (IZhO14_divide)	C++14	100 / 100	38 ms	6000 KiB

divide

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define pb push_back
#define dbg(x) cerr << #x << " " << x << "\n"

const int MAX_N = 1e5;

ll mn[1 + MAX_N];
int x[1 + MAX_N];
ll d[1 + MAX_N];
ll g[1 + MAX_N];

inline int get (int sz, ll bound) {
    int lb = 1, rb = sz, best;
    while (lb <= rb) {
        int mid = (lb + rb) / 2;
        if (mn[mid] <= bound)
            best = mid, rb = mid - 1;
        else
            lb = mid + 1;
    }
    return best;
}

int main () {
    ios::sync_with_stdio (false);
    cin.tie (0); cout.tie (0);

    int n;
    cin >> n;
    ll ans = 0;
    mn[0] = (1ll << 60);
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> g[i] >> d[i];
        d[i] += d[i - 1];
        g[i] += g[i - 1];
        mn[i] = min (mn[i - 1], d[i - 1] - x[i]);
        ans = max (ans, g[i] - g[get (i, d[i] - x[i]) - 1]);
    }
    cout << ans << "\n";
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

divide.cpp: In function 'int main()':
divide.cpp:41:55: warning: 'best' may be used uninitialized in this function [-Wmaybe-uninitialized]
   41 |         ans = max (ans, g[i] - g[get (i, d[i] - x[i]) - 1]);
      |                                  ~~~~~~~~~~~~~~~~~~~~~^~~

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