Submission #332440

#	Time	Username	Problem	Language	Result	Execution time	Memory
332440		dolphingarlic	Bigger segments (IZhO19_segments)	C++14	100 / 100	84 ms	20992 KiB

segments

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

ll a[500001], pref[500001];
pair<int, ll> dp[500001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    deque<int> dq = {0};
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
        while (dq.size() > 1 && pref[i] - pref[dq[1]] >= dp[dq[1]].second)
            dq.pop_front();
        dp[i] = {dp[dq[0]].first + 1, pref[i] - pref[dq[0]]};
        while (dq.size() && dp[dq.back()].second - dp[i].second >= pref[i] - pref[dq.back()])
            dq.pop_back();
        dq.push_back(i);
    }
    // for (int i = 1; i <= n; i++) cout << "(" << dp[i].first << ", " << dp[i].second << ") ";
    // cout << '\n';
    cout << dp[n].first;
    return 0;
}

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