Submission #651314

#	Time	Username	Problem	Language	Result	Execution time	Memory
651314		snpmrnhlol	Bigger segments (IZhO19_segments)	C++17	37 / 100	1550 ms	2400 KiB

segments

#include <iostream>

using namespace std;
typedef long long ll;
ll dp[500000],dp2[500000],v[500000];
int main()
{
    ll n,i,sum = 0,sum2,j;
    cin>>n;
    for(i = 0;i < n;i++){
        cin>>v[i];
    }
    for(i = 0;i < n;i++){
        sum+=v[i];
        dp[i] = 1;
        dp2[i] = sum;
        sum2 = v[i];
        for(j = i - 1;j >= 0;j--){
            if(sum2 >= dp2[j]){
                if(dp[j] + 1 > dp[i]){
                    dp[i] = dp[j] + 1;
                    dp2[i] = sum2;
                }
            }
            sum2+=v[j];
        }
    }
    cout<<dp[n - 1];
    return 0;
}

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