Submission #499828

#TimeUsernameProblemLanguageResultExecution timeMemory
499828reniBigger segments (IZhO19_segments)C++14
0 / 100
0 ms204 KiB
#include<iostream>
#define endl '\n'
using namespace std;
long long a[1000000], pref[1000000];
int main()
{
    //ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    long long n,i,j, first=0, sum,pr, br=0, maxr=1;

    cin>>n;

    for(i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for(i=1;i<=n-maxr;i++)
    {
        first+=a[i];
        sum=0;br=1;

        pr=first;

        for(j=i+1;j<=n;j++)
        {
           // if(n-j+br<maxr)break;
            sum+=a[j];
            if(sum>=pr)
            {
                sum=0;br++;
            }
        }
        maxr=max(maxr, br);

    }
    cout<<maxr<<endl;


}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...