제출 #556347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
556347		ngpin04	Bigger segments (IZhO19_segments)	C++14	37 / 100	1580 ms	1916 KiB

segments

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
const int N = 5e5 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

pair <int, long long> dp[N];

int a[N];
int n;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	#ifdef ONLINE_JUDGE
	// freopen(TASK".inp","r",stdin);
	// freopen(TASK".out","w",stdout);
	#endif
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i];

	for (int i = 1; i <= n; i++) {
		long long tot = 0;
		for (int j = i; j >= 1; j--) {
			tot += a[j];
			if (tot >= -dp[j - 1].se)
				maxi(dp[i], mp(dp[j - 1].fi + 1, -tot));
		}
	}

	cout << dp[n].fi << "\n";
	return 0;
}

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