Submission #689411

#	Time	Username	Problem	Language	Result	Execution time	Memory
689411		Matteo_Verz	Bigger segments (IZhO19_segments)	C++17	37 / 100	1581 ms	3036 KiB

segments

#include <bits/stdc++.h>
#ifdef BLAT
    #include "debug/debug.hpp"
#else
    #define debug(x...)
#endif

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;

    vector <int> v(1 + n), dp(1 + n);
    vector <long long> sp(1 + n), s(1 + n);

    dp[1] = 1;
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
        sp[i] = sp[i - 1] + v[i];

        dp[i] = dp[i - 1];
        s[i] = s[i - 1] + v[i];

        for (int j = 1; j < i; j++) {
            if (sp[i] - sp[j] >= s[j]) {
                if (dp[j] + 1 == dp[i])
                    s[i] = min(s[i], sp[i] - sp[j]);
                else if (dp[j] + 1 > dp[i]) {
                    s[i] = sp[i] - sp[j];
                    dp[i] = 1 + dp[j];
                }
            }
        }
    }
    
    cout << dp[n] + 1 << '\n';
    return 0;
}

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