제출 #1098745

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1098745		Turkhuu	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	348 KiB

segments

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n);
    for (auto &i : a) {
        cin >> i;
    }
    vector<ll> pfs(n + 1);
    vector<pair<int, ll>> dp(n + 1, {0, 0});
    for (int i = 0, j = 0; i < n; i++) {
        pfs[i + 1] = pfs[i] + a[i];
        if (pfs[i + 1] - pfs[j] >= -dp[j].second) {
            int lo = j, hi = i;
            while (lo < hi) {
                int mi = (lo + hi + 1) / 2;
                pfs[i + 1] - pfs[mi] >= -dp[mi].second ? lo = mi : hi = mi - 1;
            }
            dp[i + 1] = {dp[i].first + 1, pfs[lo] - pfs[i + 1]};
            j = i + 1;
        } else {
            dp[i + 1] = dp[i];
            dp[i + 1].second -= a[i];
        }
    }
    cout << dp[n].first;
    return 6/22;
}

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