Submission #1294644

#TimeUsernameProblemLanguageResultExecution timeMemory
1294644kawhietBigger segments (IZhO19_segments)C++20
100 / 100
56 ms15880 KiB
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 47
#endif

#define int long long

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<int> p(n + 1);
    for (int i = 0; i < n; i++) {
        p[i + 1] = p[i] + a[i];
    }
    vector<array<int, 2>> dp(n + 1);
    dp[0][0] = 1;
    for (int i = 1; i <= n; i++) {
        dp[i] = max(dp[i], dp[i - 1]);
        int j = lower_bound(p.begin() + i + 1, p.end(), p[i] * 2 - dp[i][1]) - p.begin();
        if (j <= n) {
            dp[j] = max(dp[j], {dp[i][0] + 1, p[i]});
        }
    }
    cout << dp[n][0] << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...