제출 #1107895

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1107895		alex_2008	Bigger segments (IZhO19_segments)	C++14	13 / 100	2 ms	4600 KiB

segments

#include <iostream>
#include <algorithm>
#include <cmath>
#define ff first
#define ss second
typedef long long ll;
using namespace std;
const int N = 5e5 + 10;
ll pref[N];
pair <ll, ll> dp[N];
ll dpp[N];
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> pref[i];
		pref[i] += pref[i - 1];
	}
	dp[0] = { 0, 0 };
	dpp[0] = 0;
	for (int i = 1; i <= n; i++) {
		int ind = upper_bound(dpp, dpp + i, pref[i]) - dpp - 1;
		dp[i] = { dp[ind].first + 1, pref[i] - pref[ind] };
		dpp[i] = dp[i].ss + pref[i];
	}
	cout << dp[n].first << "\n";
}

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