Submission #566412

#	Time	Username	Problem	Language	Result	Execution time	Memory
566412		Stickfish	Bigger segments (IZhO19_segments)	C++17	100 / 100	273 ms	14884 KiB

segments

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

const int MAXN = 5e5 + 123;
int a[MAXN];
ll psm_[MAXN];
ll* psm = psm_ + 1;
pair<int, int> dp[MAXN];

signed main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        psm[i] = psm[i - 1] + a[i];
    }
    dp[0] = {1, -1};
    for (int i = 0; i < n; ++i) {
        if (i)
            dp[i] = max(dp[i], dp[i - 1]);
        // psm[nt] - psm[i] >= psm[i] - psm[pv]
        int nt = lower_bound(psm, psm + n, psm[i] * 2 - psm[dp[i].second]) - psm;
        pair<int, int> ndp = {dp[i].first + 1, i};
        if (nt < n && ndp > dp[nt])
            dp[nt] = ndp;
        //cout << dp[i].first << ' ' << dp[i].second << "(" << nt << ")" << endl;
    }
    cout << dp[n - 1].first;
}

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