Submission #891599

#	Time	Username	Problem	Language	Result	Execution time	Memory
891599		Hovhannes1234	Bigger segments (IZhO19_segments)	C++17	13 / 100	1 ms	2648 KiB

segments

#include <bits/stdc++.h>
using namespace std;

const int N=5e5+5;
int a[N];
pair <long long, long long> dp[N];

int main()
{
    int n;
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>a[i];
        a[i] += a[i-1];
    }
    dp[0].first = 1;
    for(int i = 1; i <= n; ++i){
        dp[i] = max(dp[i], dp[i - 1]);
        auto ind = lower_bound(a + 1, a + n + 1, 2 * a[i] - dp[i].second) - a;
        dp[ind] = max(dp[ind],{ dp[i].first + 1, a[i]});
    }
    cout << dp[n].first;
}

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