Submission #332185

#	Time	Username	Problem	Language	Result	Execution time	Memory
332185		nvmdava	Bigger segments (IZhO19_segments)	C++17	100 / 100	109 ms	20060 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 500'005;
const ll MOD = 1'000'000'007;
const int INF = 0x3f3f3f3f;

ll sum[N];
int ans[N];
ll p[N];

priority_queue<pair<ll, int> > pq;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin>>n;

    for(int i = 1; i <= n; ++i){
        cin>>p[i];
        p[i] += p[i - 1];
    }

    int t = 0;

    for(int i = 1; i <= n; ++i){

        while(!pq.empty() && -pq.top().ff <= p[i]){
            t = max(t, pq.top().ss);
            pq.pop();
        }

        sum[i] = p[i] - p[t];
        ans[i] = ans[t] + 1;
        pq.push({-(p[i] + sum[i]), i});
    }
    cout<<ans[n];
}

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