Submission #74914498

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define pb push_back

template<class T> inline bool chmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template<class T> inline bool chmin(T& a, T b) { return a > b ? a = b, 1 : 0; }

const int MOD = 1e9 + 7;


void solve() {

    int n;cin>>n;
    vector<ll> l(n);
    for(int i=0;i<n;i++){
        cin>>l[i];
        l[i]*=2;
    }
    int ans=0;
    auto dfs=[&](auto& self,int idx,ll curr,int cnt)->void{
        if(idx==n){
            chmax(ans,cnt);
            return;
        }
        ll next=curr+l[idx];
        self(self,idx+1,next,cnt+((curr>0)!=(next>00)));
        ll nextneg=curr-l[idx];
        self(self,idx+1,nextneg,cnt+((curr>0)!=(nextneg>00)));
        

    };
    dfs(dfs,0,1LL,0);
    cout<<ans<<'\n';

}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int tt = 1; 
    //cin >> tt; 
    while (tt--) {
        solve();
    }
    
    return 0;
}

Submission Info

Judge Result