제출 #210257

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
210257		super_j6	Bigger segments (IZhO19_segments)	C++14	100 / 100	108 ms	12408 KiB

segments

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
#define endl '\n'
#define pi pair<int, int>
 
const int maxn = 500001;
int n;
long long a[maxn], dp[maxn], it[maxn];
set<pi> s;
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> n;
	
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		a[i] += a[i] + a[i - 1];
	}
	
	for(int i = 1; i <= n; i++){
		it[i] = max(it[i], it[i - 1]);
		dp[i] = dp[it[i]] + 1;
		it[lower_bound(a, a + n + 1, 2 * a[i] - a[it[i]]) - a] = i;
	}
	
	cout << dp[n] << endl;
 
	return 0;
}

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