제출 #910948

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
910948		daoquanglinh2007	Bigger segments (IZhO19_segments)	C++17	13 / 100	1 ms	2656 KiB

segments

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair

const int NM = 5e5;

int N, a[NM+5], pref[NM+5];
pii dp[NM+5];

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin >> N;
	for (int i = 1; i <= N; i++){
		cin >> a[i];
		pref[i] = pref[i-1]+a[i];
	}
	dp[0] = mp(0, 0);
	for (int i = 1; i <= N; i++){
		int l = 2, r = i, j = 1;
		while (l <= r){
			int mid = (l+r)/2;
			if (pref[i]-pref[mid-1] >= dp[mid-1].se){
				j = mid;
				l = mid+1;
			}
			else r = mid-1;
		}
		dp[i].fi = dp[j-1].fi+1;
		dp[i].se = pref[i]-pref[j-1];
	}
	cout << dp[N].fi;
	return 0;
}

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