제출 #341153

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341153		Dilshod_Imomov	Bigger segments (IZhO19_segments)	C++17	37 / 100	1554 ms	3968 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 = 5e5 + 7;
const int mod = 1e9 + 7;

int a[N], sum[N];
pair < int, int > dp[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++ ) {
        dp[i] = { sum[i], 1 };
    }
    for ( int i = 1; i <= n; i++ ) {
        for ( int j = i - 1; j > 0; j-- ) {
            if ( dp[j].fi <= sum[i] - sum[j] ) {
                dp[i].fi = sum[i] - sum[j];
                dp[i].se = dp[j].se + 1;
                break;
            }
        }
    }
    cout << dp[n].se;
}

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