This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=5e5+10;
const ll inf=1e18;
const ll mod=1e9+7;
ll a[maxN],n;
ll get(ll x)
{
ll sum=0;
for(int i=1;i<=x;i++)
{
sum+=a[i];
}
ll cnt=1;
for(int j=x+1;j<=n;j++)
{
ll k=j;
ll ss=0;
while(k<=n&&ss<sum)
{
ss+=a[k];
k++;
}
j=k-1;
if(ss>=sum) cnt++,sum=ss;
}
return cnt;
}
void solve()
{
cin >> n;
for(int i=1;i<=n;i++) cin >> a[i];
ll low=2,high=n;
while(low<=high)
{
ll mid=low+high>>1;
if(get(mid)>get(mid-1)) low=mid+1;
else high=mid-1;
}
cout << get(high);
}
int main()
{
fastio
//freopen(TASKNAME".INP","r",stdin);
//freopen(TASKNAME".OUT","w",stdout);
solve();
}
Compilation message (stderr)
segments.cpp: In function 'void solve()':
segments.cpp:41:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
41 | ll mid=low+high>>1;
| ~~~^~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |