Submission #1127762

#	Time	Username	Problem	Language	Result	Execution time	Memory
1127762		VMaksimoski008	Bigger segments (IZhO19_segments)	C++17	37 / 100	1596 ms	2116 KiB

segments

#include <bits/stdc++.h>
#define ar array
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

signed main() {
    int n; cin >> n;
    vector<int> a(n+1);
    vector<ll> pref(n+1);
    for(int i=1; i<=n; i++) cin >> a[i];
    for(int i=1; i<=n; i++) pref[i] = pref[i-1] + a[i];

    vector<int> dp(n+1), last(n+1);
    dp[0] = 0;

    for(int i=1; i<=n; i++) {
        for(int j=i; j>=1; j--) {
            if(2 * pref[j] - pref[last[j]] <= pref[i] && dp[i] < dp[j] + 1) {
                dp[i] = dp[j] + 1;
                last[i] = j;
            }
        }
    }

    cout << dp[n] + 1 << '\n';
    return 0;
}

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