제출 #372315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
372315		mariowong	Bigger segments (IZhO19_segments)	C++14	13 / 100	1 ms	364 KiB

segments

#include <bits/stdc++.h>
using namespace std;

long long n,a[500005],dp[500005],ps[500005],chk[500005];
deque <pair<long long,long long>  > q;
pair<long long,long long> now;
int main(){
	ios::sync_with_stdio(false);
	cin >> n;
	for (int i=1;i<=n;i++){
		cin >> a[i];
		ps[i]=ps[i-1]+a[i];
	}
	for (int i=1;i<=n;i++){
		while (!q.empty() && q.front().first <= ps[i]-ps[q.front().second]){
			now=q.front();
			q.pop_front();
		}
		dp[i]=dp[now.second]+1;
		chk[i]=ps[i]-ps[now.second];
		while (!q.empty() && q.back().first >= ps[i]-ps[now.second]){
			q.pop_back();
		}
		q.push_back(make_pair(ps[i]-ps[now.second],i));
	}
	cout << dp[n] << "\n";
    return 0;
}	

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