제출 #1134141

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

segments

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

#define ll long long
#define N 200005
#define pb push_back
#define ff first
#define ss second
#define sz(s) (int)s.size()

ll n, t, a[N], dp[N], sum[N], p[N];

int main (){
	ios::sync_with_stdio(0);cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		p[i] = p[i-1] + a[i];
	}
	dp[1] = 1;
	sum[1] = a[1];
	for(int i = 2; i <= n; i++) {
		if(a[i] >= sum[i - 1]) {
			dp[i] = dp[i-1] + 1;
			sum[i] = a[i];
			continue;
		}
		int l = 1, r = i, jog = 0;
		dp[i] = dp[i-1];
		sum[i] = sum[i-1] + a[i];
		while(l <= r) {
			int md = (l + r)/2;
			if(p[i] - p[md - 1] >= sum[md - 1]) {
				l = md + 1;
				jog = md - 1;
				continue;
			}
			r = md - 1;
		}
		dp[i] = dp[jog] + 1;
		sum[i] = p[i] - p[jog];
	}
	cout << dp[n] << '\n';
}

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