제출 #760865

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

segments

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define f first
#define s second
#define mp make_pair
#define pb push_back

template<class T> using V = vector<T>;
using ll = long long;
using pl = pair<ll, int>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N; cin >> N;
	V<int> A(N); for(auto& x : A) cin >> x;

	V<ll> P = {0}; for(auto& x : A) P.pb(P.back() + x);

	V<int> ans(N + 1, 0);
	set<pl> S = {mp(0, 0)};

	for(int i = 1; i <= N; i++) {
		// FIND l such that P[l] + SUM[l] <= P[i]

		pl p = *prev(S.upper_bound(mp(P[i], N + 1)));
		// cout << P[i] << " " << p.f << " " << p.s << nl;
		int l = p.s;


		int sum = P[i] - P[l];
		ans[i] = ans[l] + 1;
		// cout << i << " " << l << " " << sum << " " << ans[i] << nl;
		S.insert(mp(sum + P[i], i));
	}

	cout << *max_element(begin(ans), end(ans)) << nl;

    return 0;
}

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