Submission #989133

#	Time	Username	Problem	Language	Result	Execution time	Memory
989133		Chal1k	Bigger segments (IZhO19_segments)	C++14	27 / 100	48 ms	15836 KiB

segments

#include <bits/stdc++.h>
#include <math.h>
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;

#define SPEED ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define str string
#define pb push_back
#define pf push_front
#define nl "\n"
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ff first
#define ss second
#define len(a) a.size()
#define sz(v) (int)(v.size())
#define pii pair<int,int>
const int N = 5e5 + 1;
const int md = 998244353;
const int mod = 1e9 + 7;
const int mega = 1e6 + 3;
const int inf = 1e9;
int n , a[N + 1] , dp[505][505] , pref[N];
void solve(){
    cin >> n;
    for(int i = 1; i <= n; ++i)cin >> a[i] , pref[i] = pref[i - 1] + a[i];
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j){
            dp[i][j] = -inf;
        }
    }
    for(int i = 1; i <= n; ++ i) dp[1][i] = 1;
    for(int i = 1; i <= n; ++i){
        for(int j = i; j >= 1; j--){
            for(int k = j - 1; k >= 1; k--){
                int sum1 = pref[i] - pref[j - 1];
                int sum2 = pref[j - 1] - pref[k - 1];
                if(sum2 <= sum1){
                    dp[j][i] = max(dp[j][i] , dp[k][j - 1] + 1);
                }
            }
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; ++i)ans = max(dp[i][n] , ans);
    cout << ans << nl;
}
signed main(){
    SPEED;
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    #ifndef ONLINE_JUDGE
    cerr << "\n" << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
}

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