제출 #1172038

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1172038		coolboy19521	Bigger segments (IZhO19_segments)	C++20	13 / 100	0 ms	328 KiB

segments

#include "bits/stdc++.h"

#define mxN 500005

using namespace std;

long long pr[mxN];
int a[mxN];

int main(){
	int N;
	cin >> N;
	
	for (int i = 1; i <= N; i ++)
		cin >> a[i];

	priority_queue<tuple<long long,int,int>> pq;
	
	int aux = 0, ans = 0;
    pair<int,int> bs = {0, 0};
	
	for (int i = 1; i <= N; i ++){
		pr[i] = aux += a[i];

		for(;;){
			if (pq.empty()) break;
			auto [sm, cn, ix] = pq.top();
			
			sm = -sm;
			
			if (sm - aux <= 0){
                bs = max(bs, {cn, ix});
				pq.pop();
			}
			
			else break;
		}
		
		auto [cn, ix] = bs;
        ans = cn + 1;
		
		pq.emplace(pr[ix] - pr[i] - aux, cn + 1, i);
	}
	
	cout << ans << endl;
}

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