제출 #883696

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
883696		OAleksa	Bigger segments (IZhO19_segments)	C++14	100 / 100	69 ms	20820 KiB

segments

#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int maxn = 5e5 + 69;
const int inf = 1e18;
int n, a[maxn], p[maxn], dp[maxn], pos[maxn];
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
  int tt = 1;
	//cin >> tt;
  while (tt--) {
   	cin >> n;
   	for (int i = 1;i <= n;i++) 
   		cin >> a[i];
   	for (int i = 1;i <= n;i++)
   		p[i] = p[i - 1] + a[i];
   	for (int i = 1;i <= n;i++) {
   		pos[i] = max(pos[i - 1], pos[i]);
   		dp[i] = dp[pos[i]] + 1;
   		auto u = lower_bound(p + 1, p + n + 1, 2 * p[i] - p[pos[i]]) - p;
   		if (u <= n)
   			pos[u] = max(pos[u], i);
   	}
   	cout << dp[n];
	}
	return 0;
}

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