Submission #1350298

#	Time	Username	Problem	Language	Result	Execution time	Memory
1350298		tamir1	Bigger segments (IZhO19_segments)	C++20	13 / 100	1 ms	344 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++) {
        int l = 0, r = i - 1, mid, ans;
        while(l <= r) {
            mid = l + (r - l) / 2;
            int sum = p[i] - p[mid];
            if(dp[mid].ss <= sum) {
                ans = mid;
                l = mid + 1;
            } else r = mid - 1;
        }
        dp[i] = {dp[ans].ff + 1, p[i] - p[ans]};
    }
    cout << dp[n].ff << "\n";
    return 0;
}

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