Submission #481973

#	Time	Username	Problem	Language	Result	Execution time	Memory
481973		MB2	Bigger segments (IZhO19_segments)	C++14	100 / 100	80 ms	12996 KiB

segments

#include <bits/stdc++.h>
using namespace std;
int n, l2[500005], dp[500005];
long long l1[500005];
int main()
{
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        cin>>l1[i];
        l1[i]=l1[i]+l1[i-1];
    }
    for(int i=1; i<=n; i++)
    {
        l2[i]=max(l2[i], l2[i-1]);
        dp[i]=dp[l2[i]]+1;
        int j=lower_bound(l1+1, l1+1+n, 2*l1[i]-l1[l2[i]])-l1;
        if(j<=n) l2[j]=max(l2[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