提出 #74862395

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <tuple>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstdint>
#include <cmath>
#include <atcoder/all>

using namespace std;
using namespace atcoder;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); } }init;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using v2 = vector<vector<ll>>;
template<typename T, typename U>
istream& operator>>(istream& is, pair<T, U>& p) {
    is >> p.first >> p.second;
    return is;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v)
{
    for (T& in : v)
        is >> in;
    return is;
}
#define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++)
#define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++)
#define foreach(i,vec) for (auto i = begin(vec);i != end(vec);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
constexpr ll INF = 1e18;
int n;
vl l;
ll dfs(ll c,ll ct)
{
    if(ct == n) {
        return 0;
    }
    int a1 = 0;int b1 = 0;
    if((c >= 0) != (c - l[ct] >= 0)) b1 = 1;
    if((c >= 0) != (c + l[ct] >= 0)) a1 = 1;
    return max(dfs(c + l[ct],ct + 1) + a1,b1 + dfs(c - l[ct],ct + 1));
}
int main()
{
    cin >> n;
    l = vl(n);
    cin >> l;
    cout << dfs(0,0) << el;
}

提出情報

ジャッジ結果