제출 #1260669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1260669		Dreamy_lovesper	Bigger segments (IZhO19_segments)	C++20	100 / 100	53 ms	12148 KiB

segments

#include <bits/stdc++.h>

using namespace std;

// Do you think you'll ever remember me someday, or will I just fade away from your memory?
#define LIFESUCK ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define str string
#define mll map<ll, ll>
#define vll vector<ll>
#define pll pair<ll, ll>
#define fi first
#define se second
#define all(c) c.begin(), c.end()
#define pb push_back
#define mpp make_pair
#define sz(s) (int)s.size()
#define debug cout << "I Love You\n";
#define fu(i, a, b) for (ll i = a; i <= b; i++)
#define fd(i, b, a) for (ll i = b; i >= a; i--)
#define Bitc(msk, j) ((msk >> j) & 1)
#define _log(x) 31 - __builtin_clz(x)
#define LoveTime chrono::steady_clock::now().time_since_epoch().count()

const ll Mod = 998244353;
const ll inf = (1ll << 30);
const ll lnf = (1ll << 60);

// When time passes and things change... will you still remember someone like me?
int64_t add(ll &a, ll b) {
    a += b;
    if (a >= Mod) a %= Mod;
    while (a < 0) a += Mod;
    return a;
}
int64_t mul(ll a, ll b) {
    a = 1ll * a * b % Mod;
    return a;
}

template <class X, class Y>
bool minimize(X &x, 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, Y y) {
    // X eps = 1e-9;
    if (x < y) {
        x = y;
        return 1;
    }
    return 0;
}

// I wonder… will I just become a distant memory to you one day?
#define mxn 500'007
ll n, g[mxn], pref[mxn];
pll p[mxn];

// The world is still beautiful, only it’s a pity that you are no longer among the living.
void lovesper(const ll &TestCase) {
    cin >> n;
    fu(i, 1, n) {
        ll x; cin >> x;
        pref[i] = pref[i - 1] + x;
    }

    p[1] = {1, 0};
    fu(i, 1, n) {
        maximize(p[i], p[i - 1]);
        ll j = -1, l = i, r = n;
        while(l <= r) {
            ll mid = l + (r - l) / 2;
            if(pref[mid] - pref[i] >= pref[i] - pref[p[i].se]) j = mid, r = mid - 1;
            else l = mid + 1;
        }
        p[j] = max(p[j], {p[i].fi + 1, i});
    }

    cout << p[n].fi;

}


//    In the future, each of us will have our own path..
// ...But no matter where we go, we will always be a beautiful part of each other’s memories.
signed main() {
    LIFESUCK

    #define name "lovesper"
    // freopen(name".inp", "r", stdin);
    // freopen(name".out", "w", stdout);

    ll Test = 1;
    // cin >> Test;

    fu(i, 1, Test) {
        lovesper(i);
        if (i < Test) cout << '\n';
    }

    return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 36 / 36
• Subtask 5: 27 / 27