Submission #74843915

---

Source Code Expand

#include<bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, n) for(int  i = 0; i < (n); ++i)
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
int gcd(int a, int b){
    if(b == 0) return a;  
    else return gcd(b, a%b);
}
struct Compare {
    bool operator()(const pair<ll, int>& a, const pair<ll, int>& b) {
        return a.first > b.first;  
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vector<double> l(n);
    rep(i,n) cin >> l[i];
    int ans = 0;
    for(int bit = 0; bit < (1<<n);bit++){
        double now = 0.5;
        int tmp = 0;
        rep(i,n){
            double pre = now;
            if(bit & (1<<i)){
                now += l[i];
                if(pre * now < 0) tmp++;
            }else{
                now -= l[i];
                if(pre * now < 0) tmp++;
            }
        }
        chmax(ans, tmp);
    }
    cout << ans << endl;
}

Submission Info

Judge Result