제출 #1098336

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1098336		ezzzay	Bigger segments (IZhO19_segments)	C++14	100 / 100	163 ms	20912 KiB

segments

#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define ff first
#define ss second
#define pb push_back
const int N=3e6+5;
int a[N];
int par[N];
int dp[N];
signed main(){
    int n;
    cin>>n;
    vector<int>ps(n+1);
    for(int i=1;i<=n;i++){
        cin>>a[i];
        ps[i]=ps[i-1]+a[i];
    }
    for(int i=1;i<=n;i++){
        par[i]=max(par[i],par[i-1]);
        
        dp[i]=dp[par[i]]+1;
        auto it=lower_bound(ps.begin(),ps.end(),ps[i]*2-ps[par[i]]);
        int j=it-ps.begin();
        par[j]=i;
    }
    
    cout<<dp[n];
}

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