Submission #869124

#	Time	Username	Problem	Language	Result	Execution time	Memory
869124		12345678	Bigger segments (IZhO19_segments)	C++17	37 / 100	3 ms	604 KiB

segments

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=3e3+5;
ll dp[nx], a[nx], qs[nx], lst[nx], n;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>a[i], qs[i]=qs[i-1]+a[i];
    for (int i=1; i<=n; i++)
    {
        for (int j=i; j>=1; j--)
        {
            if (qs[i]-qs[j-1]>=lst[j-1])
            {
                dp[i]=dp[j-1]+1;
                lst[i]=qs[i]-qs[j-1];
                break;
            }
        }
    }
    cout<<dp[n];
}

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