제출 #1171495

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

segments

#include <bits/stdc++.h>

using namespace std;

int const MAX=5e5+5;
int n;
int v[MAX];
long long sp[MAX];
struct sol{
    int cnt,ind;
    bool operator<(sol ot){
        if(cnt!=ot.cnt)
            return cnt<ot.cnt;
        return ind<ot.ind;
    }
}dp[MAX];

void read(){
    cin>>n;
    int i;
    for(i=1;i<=n;++i){
        cin>>v[i];
        sp[i]=sp[i-1]+v[i];
    }
}

long long get_sp(int l,int r){
    return sp[r]-sp[l-1];
}

int get_dp(){
    int i,j;
    for(i=1;i<=n;++i){
        dp[i]={1,0};
        for(j=1;j<i;++j)
            if(get_sp(dp[j].ind+1,j)<=get_sp(j+1,i)){
                sol cand={dp[j].cnt+1,j};
                if(dp[i]<cand)
                    dp[i]=cand;
            }
    }
    return dp[n].cnt;
}

int main()
{
    read();
    cout<<get_dp();
    return 0;
}

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