Submission #332339

#	Time	Username	Problem	Language	Result	Execution time	Memory
332339		dolphingarlic	Bigger segments (IZhO19_segments)	C++14	37 / 100	1587 ms	2924 KiB

segments

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

ll a[500001], pref[500001];
pair<int, ll> dp[500001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
        for (int j = 0; j < i; j++) if (dp[j].second >= pref[j] - pref[i])
            dp[i] = max(dp[i], {dp[j].first + 1, pref[j] - pref[i]});
    }
    cout << dp[n].first;
    return 0;
}

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