Submission #1313173

#TimeUsernameProblemLanguageResultExecution timeMemory
1313173boclobanchatBigger segments (IZhO19_segments)C++20
0 / 100
0 ms332 KiB
#include<bits/stdc++.h>
using namespace std;
const int MAXN=5e5+5;
long long pref[MAXN];
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>pref[i];
		pref[i]+=pref[i-1];
	}
	int ans=1,l=1,r=1;
	while(true)
	{
		if(pref[n]-pref[r]<pref[r]-pref[l-1]) break;
		int pos=r+1;
		while(pref[pos]-pref[r]<pref[r]-pref[l-1]) pos++;
		while(pref[pos]-pref[r]>=pref[r]-pref[l-1]) r++;
		l=r,r=pos,ans++;
	}
	cout<<ans;
}
#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...