Submission #1349939

#	Time	Username	Problem	Language	Result	Execution time	Memory
1349939		tamir1	Bigger segments (IZhO19_segments)	C++20	37 / 100	1594 ms	3496 KiB

segments

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

#define int long long
#define ff first 
#define ss second

const int inf = 1e18;

signed main() {

    int n;
    cin >> n;

    vector<int> a(n + 1);
    for(int i = 1; i <= n; i++) cin >> a[i];
    
    vector<pair<int, int>> dp(n + 1, {0, inf});
    vector<int> p(n + 1, 0);
    for(int i = 1; i <= n; i++) {
        p[i] = p[i - 1] + a[i];
    }
    dp[0] = {0, 0};
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= i; j++) {
            int sum = p[i] - p[j - 1];
            if(sum >= dp[j - 1].ss) {
                if(dp[i].ff < dp[j - 1].ff + 1) {
                    dp[i] = {dp[j - 1].ff + 1, sum};
                } else if(dp[i].ff == dp[j - 1].ff + 1) {
                    dp[i].ss = min(dp[i].ss, sum);
                }
            }
        }
    }
    cout << dp[n].ff << "\n";




    return 0;
}

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