제출 #862965

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

segments

#include<bits/stdc++.h>

using namespace std;

const long long int N=1e9+7;

void upd(pair<int, int> &a, pair<int, int> b) {
    if (a.first < b.first)
        a = b;
    if (a.first == b.first)
        a = min(a, b);
}

int main(){
    // #ifndef ONLINE_JUDGE
    //     freopen("input.txt", "r", stdin);
    //     freopen("output.txt", "w", stdout);
    // #endif
    ios::sync_with_stdio(0); cin.tie(nullptr);
    int n;
    cin>>n;
    vector<int>a(n),prf(n+1);
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        prf[i+1]=a[i]+prf[i];
    }
    vector<pair<int,int>>dp(n+1,{-1e9,0});
    dp[0]={0,0};
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            int vl = prf[j] - prf[i];
            if(dp[i].second<=vl)
                upd(dp[j],{dp[i].first+1,vl});
        }
    }
    cout<<dp[n].first<<endl;
    return 0;
}
/*
*/

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