Submission #862966

#	Time	Username	Problem	Language	Result	Execution time	Memory
862966		JelalTkm	Bigger segments (IZhO19_segments)	C++17	37 / 100	1567 ms	3932 KiB

segments

//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#define all(x) x.begin(), x.end()
using namespace std;
#define int long long
void upd(pair<int, int> &a, pair<int, int> b) {
    if (a.first < b.first)
        a = b;
    if (a.first == b.first)
        a = min(a, b);
}
void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> prf(n + 1);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        prf[i + 1] = prf[i] + a[i];
    }
    vector<pair<int, int>> dp(n + 1, {-1e9, 0});
    dp[0] = {0, 0};
    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j <= n; ++j) {
            int vl = prf[j] - prf[i];
            if (dp[i].second <= vl)
                upd(dp[j], {dp[i].first + 1, vl});
        }
    }
    cout << dp[n].first << '\n';
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    while (t--) {
        solve();
    }
}

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