Submission #374120

#	Time	Username	Problem	Language	Result	Execution time	Memory
374120		mariowong	Bigger segments (IZhO19_segments)	C++14	13 / 100	1 ms	364 KiB

segments

#include <bits/stdc++.h>
using namespace std;
 
int n,now;
long long a[500005],ps[500005];
pair <long long,int> dp[500005];
deque <int> q;
int main(){
	ios::sync_with_stdio(false);
	cin >> n;
	for (int i=1;i<=n;i++){
		cin >> a[i];
		ps[i]=ps[i-1]+a[i];
	}
	for (int i=1;i<=n;i++){
		while (!q.empty() && dp[q.front()].first <= ps[i]-ps[q.front()]){
			now=q.front();
			q.pop_front();
		}
		dp[i]=make_pair(ps[i]-ps[now],dp[now].second+1);
		while (!q.empty() && dp[q.back()].first >= ps[i]-ps[now]){
			q.pop_back();
		}
		q.push_back(i);
	}
	cout << dp[n].second << "\n";
    return 0;
}	

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