제출 #628702

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

segments

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
 
int n;
int a[mxN];
ll pre[mxN];
pair<ll, int> dp[mxN];
 
void solve()
{
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i];

	for(int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];

	dp[0] = {0, 0};
	for(int i = 1; i <= n; i++) {
		for(int j = i - 1; j >= 0; j--) {
			if(pre[i] - pre[j] >= dp[j].fi) {
				dp[i] = {pre[i] - pre[j], dp[j].se + 1};
				break;
			}
		}
	}

	cout << dp[n].se;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

 
    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

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