제출 #572502

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
572502		vovamr	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	320 KiB

segments

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

inline void solve() {
	int n;
	cin >> n;
	ve<int> a(n + 1);
	for (int i = 1; i <= n; ++i) cin >> a[i];

	ve<ll> p(n + 1);
	for (int i = 1; i <= n; ++i) p[i] = p[i - 1] + a[i];

	ve<pll> dp(n + 1);
	for (int i = 1; i <= n; ++i) {
		chmax(dp[i], mpp(1ll, 0ll));

		ll need = 2 * p[i] - p[dp[i].se];
		int pos = lower_bound(all(p), need) - p.begin();
		if (pos <= n) chmax(dp[pos], mpp(dp[i].fi + 1, i * 1ll));
	}
	cout << dp[n].fi;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

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