Submission #155559

#	Time	Username	Problem	Language	Result	Execution time	Memory
155559		semiauto	Bigger segments (IZhO19_segments)	C++14	37 / 100	39 ms	988 KiB

segments

#include <bits/stdc++.h>
using namespace std;
int n,i,j;
long long mas[3001],sum[3001];
pair <int,long long> dp[3001];
int main() {
    cin>>n;
    for (i=1;i<=n;i++) {
        cin>>mas[i];
        sum[i]=sum[i-1]+mas[i];
    }
    for (i=1;i<=n;i++)
        for (j=0;j<i;j++)
            if ((-dp[j].second)<=(sum[i]-sum[j]))
                dp[i]=max(dp[i],{dp[j].first+1,sum[j]-sum[i]});
    cout<<dp[n].first<<endl;
}

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