제출 #1186845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1186845		PieArmy	Bigger segments (IZhO19_segments)	C++20	37 / 100	158 ms	327680 KiB

segments

#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define fr first
#define sc second
#define endl '\n'
using namespace std;

int n;
ll arr[500023];
vector<vector<int>>dp;

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
		arr[i]+=arr[i-1];
	}
	dp.resize(n+2,vector<int>(n+1,0));
	dp[1][0]=1;
	for(int i=1;i<=n;i++){
		for(int j=0;j<i;j++){
			if(dp[i][j]==0)continue;
			dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
			int l=i+1,r=n+1;
			while(l<r){
				int m=(l+r)/2;
				if(arr[m]+arr[j]>=arr[i]*2)r=m;
				else l=m+1;
			}
			if(l!=n+1){
				dp[l][i]=max(dp[l][i],dp[i][j]+1);
			}
		}
	}
	int ans=0;
	for(int i=0;i<=n;i++){
		ans=max(ans,dp[n+1][i]);
	}
	cout<<ans;
}

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