제출 #1114347

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

segments

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main()
{
    int n; cin >> n;
    vector<int> a(n + 1), pref(n + 1);
    for (int i = 1;  i<= n; i++){
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
    }
    vector<vector<int>> dp(n + 1, vector<int> (n + 1, 1e18));
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++){
        for (int j = 0; j < i; j++){
           for (int k = 0; k < i; k++){
               int suma = pref[i] - pref[k];
               if (suma >= dp[k][j]){
                   dp[i][j + 1] = min(dp[i][j + 1], suma);
                   break;
               }
           }
        }
    }
    
    int ans = 0;
    for (int i = 1; i <= n; i++){
        
        if (dp[n][i] != 1e18) ans = max(ans, i);
    }
    cout << ans << endl;
}

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