제출 #1285339

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285339		Hurryup_7735	Bigger segments (IZhO19_segments)	C++20	0 / 100	2 ms	572 KiB

segments

//In The Name Of ALLAH!
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
 
using namespace __gnu_pbds;
using namespace std;
 
#define ll long long
#define ld long double
#define endl '\n'
#define pb push_back
#define pf push_front
#define Zemur007 ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define bpc __builtin_popcountll
#define btz __builtin_ctzll
#define all(x) x.begin() , x.end()
#define allr(x) x.rbegin() , x.rend()
#define F first
#define S second
#define pll pair<ll , ll>
#define turtle tuple<ll , ll , ll>
#define pss pair<string , string>
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define indexed_set tree<pll , null_type , less<pll> , rb_tree_tag , tree_order_statistics_node_update>


const ll sz = 3e3 + 5 , INF = 1e18 ,  MOD = 1e9 + 7;
ll a[sz] , dp[sz][sz] , pref[sz];

ll mask , i , j , k;
void solve(){
    ll n; cin >> n;
    for(i = 1 ; i <= n ; i++) cin >> a[i] , pref[i] = pref[i - 1] + a[i];
    for(i = 1 ; i <= n ; i++) dp[i][i] = 1;
    for(i = 1 ; i <= n ; i++){
        for(j = i + 1 ; j <= n ; j++){
            for(k = j ; k >= i ; k--){
                if(pref[j] - pref[k] >= pref[k] - pref[i - 1]){
                    dp[i][j] = max(dp[i][j] , dp[i][k] + 1);
                }
            }
        }
    }
    ll ans = 0;
    for(i = 1 ; i <= n ; i++){
        ans = max(ans , dp[i][n]);
    }
    cout << ans << endl;
}     

 
signed main(){
    Zemur007;
    //open;
    ll t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
    // for(ll testcase = 1 ; testcase <= t ; testcase++){
    //     cout << "Case " << testcase << ":" << endl;
    //     solve();
    // }
}

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