제출 #1098812

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1098812		ezzzay	Bigger segments (IZhO19_segments)	C++14	0 / 100	0 ms	348 KiB

segments

#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define ff first
#define ss second
#define pb push_back
const int N=3e6+5;
int a[N];
pair<int,int> dp[N];
int ps[N];
signed main(){
    int n;
    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++){
        for(int j=0;j<i;j++){
            if(-dp[j].ss <= ps[i]-ps[j]){
                dp[i]=max(dp[i],{dp[j].ff+1,-(ps[i]-ps[j])});
              break;
            }
        }
    }
    cout<<dp[n].ff;
}

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