Submission #1294631

#	Time	Username	Problem	Language	Result	Execution time	Memory
1294631		kawhiet	Bigger segments (IZhO19_segments)	C++20	0 / 100	0 ms	332 KiB

segments

#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<int> p(n + 1);
    for (int i = 0; i < n; i++) {
        p[i + 1] = p[i] + a[i];
    }
    vector<array<int, 2>> dp(n + 1);
    dp[1][0] = 1;
    for (int i = 1; i <= n; i++) {
        dp[i] = max(dp[i], dp[i - 1]);
        int j = lower_bound(p.begin(), p.end(), p[i] * 2 - dp[i][1]) - p.begin();
        if (j <= n) {
            dp[j] = max(dp[j], {dp[i][0] + 1, p[j]});
        }
    }
    cout << dp[n][0] << '\n';
    return 0;
}

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