제출 #746974

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
746974		Denkata	Bigger segments (IZhO19_segments)	C++14	100 / 100	93 ms	20812 KiB

segments

#include<bits/stdc++.h>
using namespace std;
const int maxn = 5e5+3;
long long i,j,p,q,n,m,k;
long long uk,dp[maxn],pref[maxn],a[maxn],pos[maxn],l,r,mid;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>a[i];
        pref[i]=pref[i-1]+a[i];
    }

    for(i=1;i<=n;i++)
    {
        pos[i] = max(pos[i],pos[i-1]);
        p = pref[i]-pref[pos[i]];
        dp[i] = dp[pos[i]]+1;
        l = i;
        r = n;
        q = 0;
        while(l<=r)
        {
            mid = (l+r)/2;
            if(pref[mid]-pref[i]>=p)
                r = mid-1,q=mid;
            else l = mid+1;
        }
        pos[q] = i;
    }
    cout<<dp[n]<<endl;
    return 0;
}
///ketevan is a legend

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