Submission #1172025

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172025		AtabayRajabli	Bigger segments (IZhO19_segments)	C++20	0 / 100	0 ms	328 KiB

segments

#include <bits/stdc++.h>
#define int long long
#define all(v) v.begin(), v.end()
using namespace std;

const int sz = 3e3 + 1, inf = 1e18;
int n, a[sz], dp[sz][sz];

signed main()
{                                                                  
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
        a[i] += a[i - 1];
    }
    // dp[i][j][k] -> ends at i, j blocks
    for(int i = 0; i <= n; i++) fill(dp[i], dp[i] + 1 + n, inf);
    for(int i = 1; i <= n; i++) dp[i][1] = a[i];
    for(int i = 2; i <= n; i++)
    {
        for(int j = 2; j <= i; j++)
        {
            dp[i][j] = dp[i - 1][j];
            for(int k = j; k <= i; k++)
            {
                int sm = a[i] - a[k - 1];
                if(sm >= dp[k - 1][j - 1]) dp[i][j] = min(dp[i][j], sm);
            }
        }
    }
    int last = -1;
    for(int i = 1; i <= n; i++)
    {
        if(dp[n][i] != inf) last = i;
    }
    cout << last;
}

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