Submission #334846

#	Time	Username	Problem	Language	Result	Execution time	Memory
334846		Gurban	Bigger segments (IZhO19_segments)	C++17	37 / 100	1554 ms	2860 KiB

segments

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxn=5e5+5;
int n,a[maxn];
ll p[maxn];
pair<int,ll>dp[maxn];

ll f(int l,int r){return p[r]-p[l-1];}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	for(int i = 1;i <= n;i++) cin >> a[i],p[i]=p[i-1]+a[i];
	for(int i = 1;i <= n;i++){
		for(int j = i-1;j >= 0;j--)
			if(f(j+1,i) >= dp[j].second){dp[i]={dp[j].first+1,f(j+1,i)};break;}
		if(dp[i].first == 0) dp[i] = {dp[i-1].first,dp[i-1].second+1};
	}
	cout<<dp[n].first;
}

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