제출 #1134137

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1134137		Agageldi	Bigger segments (IZhO19_segments)	C++17	37 / 100	1596 ms	2316 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];

int main (){
	ios::sync_with_stdio(0);cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	dp[1] = 1;
	sum[1] = a[1];
	for(int i = 2; i <= n; i++) {
		sum[i] = sum[i-1] + a[i];
		dp[i] = dp[i - 1];
		ll jog = a[i];
		for(int j = i - 1; j >= 1; j--) {
			if(jog >= sum[j]) {
				dp[i] = dp[j] + 1;
				sum[i] = jog;
				break;
			}
			else jog += a[j];
		}
	}

	cout << dp[n] << '\n';
}

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