제출 #512403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
512403		MurotY	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	304 KiB

segments

#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long 
#define ff first
#define ss second
using namespace std;
const int N=1e6+7;
ll a[N];
int main()
{
	ll n;
	cin >> n;
	for (int i=1;i<=n;i++) cin >> a[i];
	ll sum=0, ans=0;
	for (int i=1;i<=n;i++){
		sum+=a[i];
		ll res=1;
		ll sum1=0;
		for (int j=i+1;j<=n;j++){
			sum1+=a[j];
			if (sum1 >= sum) res++, sum1=0;
		}
		ans=max(ans, res);
	}
	cout << ans;
}

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