Submission #868724

#	Time	Username	Problem	Language	Result	Execution time	Memory
868724		alexdd	Bigger segments (IZhO19_segments)	C++17	0 / 100	0 ms	348 KiB

segments

#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[500005];
signed main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    int mxm=1;
    for(int st=1;st<=n;st++)
    {
        int cur=0,prec=0,cnt=1;
        for(int i=1;i<=st;i++)
            prec+=a[i];
        for(int i=st+1;i<=n;i++)
        {
            cur+=a[i];
            if(cur>=prec)
            {
                cnt++;
                prec=cur;
                cur=0;
            }
        }
        mxm=max(mxm,cnt);
    }
    cout<<mxm;
    return 0;
}
/**

dp[i][j] = suma minima a ultimei secvente daca primele i elemente sunt impartite in j secvente
dp[i][j] = min(dp[i-1][j]+a[i], dp[i-k][])

*/

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