제출 #883448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
883448		NintsiChkhaidze	Bigger segments (IZhO19_segments)	C++17	100 / 100	60 ms	20920 KiB

segments

#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
#define left (h<<1),l,(l + r)/2
#define right ((h<<1)|1),(l + r)/2 + 1,r
#define pii pair<int,int>
#define ll long long 
#define int ll //?
using namespace std;

const int N = 5e5 + 5;

int a[N],p[N];
pii dp[N];

signed main (){
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
	
	int n;
	cin>>n;

	for (int i = 1; i <= n; i++){
		cin >> a[i];
		p[i] = p[i - 1] + a[i]; 
	}

	dp[0] = {1,0};
	for (int i = 1; i <= n; i++){
		dp[i] = max(dp[i],dp[i - 1]);
		int val = 2*p[i] - dp[i].s;

		int l = i + 1,r = n,res = 0;
		while (l <= r){
			int mid = (l + r) >> 1;
			if (p[mid] >= val){
				res = mid;
				r = mid - 1;
			}else{
				l = mid + 1;
			}
		}

		if (res) dp[res] = max(dp[res],{dp[i].f + 1,p[i]});
	}
	cout<<dp[n].f;
}

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