Submission #1131131

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131131		Tsagana	Bigger segments (IZhO19_segments)	C++20	100 / 100	85 ms	12104 KiB

segments

#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define int long long
#define pq priority_queue
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second

using namespace std;

int dp[500001];
int a[500001];
int b[500001];

void solve () {
	int n, m; cin >> n;
	for (int i = 1; i <= n; i++) {cin >> a[i]; a[i] += a[i-1];}
	for (int i = 1; i <= n; i++) {
		b[i] = max(b[i], b[i-1]);
		dp[i] = dp[b[i]]+1;
		int k = 2 * a[i] - a[b[i]];
		int p = lb(a+1, a+n+1, k) - a;
		b[p] = max(b[p], i);
	}
	cout << dp[n] << '\n';
}
signed main() {IOS solve(); return 0;}

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