제출 #341120

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341120		Dilshod_Imomov	Bigger segments (IZhO19_segments)	C++17	13 / 100	1558 ms	15872 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 = 5e3 + 7;
const int mod = 1e9 + 7;
 
int a[N], sum[N], ans, cnt, n;

map < int, int > used[N], dp[N];

int solve( int pos, int sm ) {
    if ( pos == n + 1 ) {
        return 0;
    }
    if ( used[pos][sm] ) {
        return dp[pos][sm];
    }
    used[pos][sm] = 1;
    int s = 0, mx = 0;
    for ( int i = pos; i <= n; i++ ) {
        s += a[i];
        if ( s >= sm ) {
            mx = max( mx, 1 + solve( i + 1, s ) );
        }
    }
    dp[pos][sm] = mx;
    return mx;
}

int32_t main() {
    speed; 
    cin >> n;
    for ( int i = 1; i <= n; i++ ) {
        cin >> a[i];
        sum[i] = sum[i - 1] + a[i];
    }
    cout << solve( 1, 0 );
}

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