제출 #1058840

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

segments

#include <bits/stdc++.h>
#ifdef LOCAL
    #include "/home/trcmai/code/tools.h"
    #define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
    #define debug(x...)
#endif
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
#define endl '\n'
const int N = 1e6 + 6, LOG = 27, MOD = 1e9 + 7;
const ll INF = 1e18;
int n;
ll a[N];
signed main() {
    cin.tie(0)->sync_with_stdio(0);
    auto solver=[&](){
        cin>>n;
        for(int i = 1;i <= n;++i){
            cin>>a[i];
            a[i] += a[i - 1];
        }
        /*
            dp[i] la max group tai vi tri thu i 
            opt[i] la min sum cua nhom chua vi tri thu i 
            dp[i] = dp[j - 1] + 1 voi j = vi tri gan nhat ma opt[j - 1] <= sum[i..j]
        */
        vector<ll>dp(n + 1),opt(n + 1);
        for(int i = 1;i <= n;++i){
            for(int j = i;j >= 1;--j){
                ll sum = a[i] - a[j - 1];
                if(opt[j - 1] <= sum){
                    dp[i] = dp[j - 1] + 1;
                    opt[i] = sum;
                    break;
                }
            }
        }
        cout<<dp[n]<<endl;
    };
    int t = 1; // cin>>t;
    while (t--) solver();
}

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