Submission #1343772

#TimeUsernameProblemLanguageResultExecution timeMemory
1343772ppmn_6Bigger segments (IZhO19_segments)C++20
100 / 100
69 ms18412 KiB
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, cur = 0;
	cin >> n;
	vector<ll> a(n + 1), val(n + 1);
	vector<int> cnt(n + 1);
	priority_queue<pair<ll, int>> pq;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		a[i] += a[i - 1];
		while (pq.size() && pq.top().first >= -a[i]) {
			cur = max(cur, pq.top().second);
			pq.pop();
		}
		cnt[i] = cnt[cur] + 1;
		val[i] = a[i] - a[cur];
		pq.push({-val[i] - a[i], i});
	}
	cout << cnt[n];
	
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...