제출 #889282

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
889282		kim	Bigger segments (IZhO19_segments)	C++17	37 / 100	1561 ms	15196 KiB

segments

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

ll a[500005],qs[500005];
struct A{
	int cnt;
	ll val;
	A(int cnt_=0,ll val_=0):cnt(cnt_),val(val_){}
	bool operator<(const A&o)const{
		if(cnt!=o.cnt) return cnt>o.cnt;
		return val<o.val;
	}
}dp[500005];

int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	
	int n; cin>>n;
	for(int i=1;i<=n;++i){
		cin>>a[i];
		qs[i]=qs[i-1]+a[i];
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=i;++j){
			if(qs[i]-qs[j-1]>=dp[j-1].val) dp[i]=min(dp[i],A(dp[j-1].cnt+1,qs[i]-qs[j-1]));
		}
	}
	cout<<dp[n].cnt;

	return 0;
}

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