제출 #287946

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287946		oolimry	Bigger segments (IZhO19_segments)	C++14	37 / 100	363 ms	262148 KiB

segments

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
using namespace std;
typedef long long lint;
typedef pair<lint,lint> ii;

lint arr[500006];
lint prefix[500006];

lint most[500006];
lint take[500006];

struct node{
	lint s, e, m;
	ii val = ii(0,0);
	node *l = nullptr, *r = nullptr;
	
	node(lint S, lint E){
		s = S, e = E, m = (s+e)/2LL;
		val = ii(0,0);
	}
	
	void create(){
		if(s == e) return;
		l = new node(s, m);
		r = new node(m+1, e);
	}
	
	void update(lint X, ii V){
		if(s == e) val = V;
		else{
			if(l == nullptr) create();
			
			if(X <= m) l->update(X, V);
			else r->update(X, V);
			
			val = max(l->val, r->val);
		}
	}
	
	ii query(lint S, lint E){
		if(S == s && e == E) return val;
		else{
			if(l == nullptr) create();
			
			if(E <= m) return l->query(S, E);
			else if(S >= m+1) return r->query(S, E);
			else return max(l->query(S, m), r->query(m+1, E));
		}
	}
} *root = new node(0, 1e16);

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	int n; cin >> n;
	for(int i = 1;i <= n;i++) cin >> arr[i];
	for(int i = 1;i <= n;i++) prefix[i] = prefix[i-1] + arr[i];
	
	
	root->update(0, ii(0,0));
	
	for(int i = 1;i <= n;i++){
		ii res = root->query(0, prefix[i]);
		most[i] = res.first + 1;
		take[i] = prefix[i] - res.second;

		root->update(take[i] + prefix[i], ii(most[i], prefix[i]));
	}
	
	cout << most[n];
}

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