Submission #532472

#	Time	Username	Problem	Language	Result	Execution time	Memory
532472		cheissmart	Bigger segments (IZhO19_segments)	C++14	100 / 100	85 ms	12912 KiB

segments

#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

string _reset = "\u001b[0m", _yellow = "\u001b[33m", _bold = "\u001b[1m";
void DBG() { cerr << "]" << _reset << endl; }
template<class H, class...T> void DBG(H h, T ...t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...);
}
#ifdef CHEISSMART
#define debug(...) cerr << _yellow << _bold << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define debug(...)
#endif

const int INF = 1e9 + 7;

signed main()
{
	IO_OP;

	int n;
	cin >> n;
	V<ll> a(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		a[i] += a[i - 1];
	}
	V<pi> dp(n + 1, {1, 0});
	for(int i = 1; i <= n; i++) {
		if(i) dp[i] = max(dp[i], dp[i - 1]);
		ll need = a[i] * 2 - a[dp[i].S];
		auto j = lower_bound(ALL(a), need) - a.begin();
		if(j <= n)
			dp[j] = max(dp[j], {dp[i].F + 1, i});
	}
	cout << dp[n].F << '\n';

}

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