Submission #1266289

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266289		kawhiet	Bigger segments (IZhO19_segments)	C++20	37 / 100	1592 ms	3140 KiB

segments

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

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

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