Submission #769908

#	Time	Username	Problem	Language	Result	Execution time	Memory
769908		Ahmed57	Bigger segments (IZhO19_segments)	C++17	100 / 100	63 ms	23336 KiB

segments

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;
int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    long long n;cin>>n;
    long long arr[n];
    vector<long long> pref = {0};
    for(int i = 0;i<n;i++){
        cin>>arr[i];
        pref.push_back(pref.back()+arr[i]);
    }
    vector<pair<long long,int>> v;v.push_back({0,0});
    int dp[n+1] = {0};
    for(int i = 1;i<=n;i++){
        pair<long long,int> xd = {pref[i],n+1};
        int it = lower_bound(v.begin(),v.end(),xd)-v.begin();
        it--;dp[i] = dp[v[it].second]+1;
        long long sum = pref[i]+pref[i]-pref[v[it].second];
        while(!v.empty()&&v.back().first>=sum)v.pop_back();
        v.push_back({sum,i});
    }
    cout<<dp[n]<<endl;
    return 0;
}

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