Submission #340888

#	Time	Username	Problem	Language	Result	Execution time	Memory
340888		Dilshod_Imomov	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	364 KiB

segments

# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second
 
using namespace std;
 
const int N = 5e2 + 7;
const int mod = 1e9 + 7;

int a[N], sum[N], dp[N][N];

int32_t main() {
    speed; 
    int n;
    cin >> n;
    for ( int i = 1; i <= n; i++ ) {
        cin >> a[i];
        sum[i] = sum[i - 1] + a[i];
    }
    for ( int i = 1; i <= n; i++ ) {
        for ( int j = i; j > 0; j-- ) {
            for ( int k = j - 1; k >= 0; k-- ) {
                int sm = sum[j - 1];
                if ( k != 0 ) {
                    sm -= sum[k - 1];
                }
                if ( sum[i] - sum[j - 1] >= sm ) {
                    dp[i][j] = max( dp[i][j], dp[j - 1][k] + 1 );
                }
            }
            // cout << i << ' ' << j << ' ' << dp[i][j] << endl;
        }
    }
    int mx = 0;
    for ( int i = 1; i <= n; i++ ) {
        mx = max( mx, dp[n][i] );
    }
    cout << mx;
}

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