Submission #522638

#	Time	Username	Problem	Language	Result	Execution time	Memory
522638		nafis_shifat	Bigger segments (IZhO19_segments)	C++17	37 / 100	1574 ms	3372 KiB

segments

#include<bits/stdc++.h>
#define ll long long
#define pii pair<ll,ll>
using namespace std;
const int mxn=1e5+5;
const int inf=1e9;
pii dp[mxn];
ll a[mxn], pre[mxn];
int n;
int main() {
	cin >> n;
	pre[0] = 0;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		pre[i] = pre[i - 1] + a[i];
	}

	dp[0] = {0, 0};

	for(int i = 1; i <= n; i++) {
		dp[i] = {1, -pre[i]};
		for(int j = i - 1; j >= 1; j--) {
			if(pre[i] - pre[j] >= -dp[j].second) {
				dp[i] = max(dp[i], make_pair(dp[j].first + 1, -pre[i] + pre[j]));
			}
		}

	}

	cout<<dp[n].first<<endl;
	
}

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