제출 #685376

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

segments

#include <bits/stdc++.h>
#define N 500005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
using namespace std;

int a[N];

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
	}
	ll sum = 0;
	int mx = 0;
	for (int i = 1; i <= n; i++){
		sum += a[i];
		ll sm = 0, old = sum;
		int cnt = 1;
		for (int j = i+1; j <= n; j++){
			sm += a[j];
			if (sm >= old){
				old = sm;
				sm = 0;
				cnt++;					
			}
		}
		if (sm) cnt--;
		mx = max(mx, cnt);
	}
	cout << mx;
}	

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