提出 #74849868

---

ソースコード 拡げる

import Foundation
import Collections
import Algorithms
import AcFoundation
import AtCoder
//import IOUtil
import Convenience


func main() {
    
    let N: Int = .stdin
    let L: [Int] = .stdin(columns: N)
    
    var ans = 0
    // bit 全探索
    
    for i in 0..<(1 << N) {
        var A: [Int] = []
        for j in 0..<N {
            let bit = (1 << j)
            if (i & bit) == bit {
                A.append(1)
            } else {
                A.append(0)
            }
        }
        
        var tmp = 0
        var now = 1
        for j in 0..<N {
            let l = L[j] * 2
            if A[j] == 1 {
                // 右へ
                let old = now
                now += l
                if now < 0, old > 0 {
                    tmp += 1
                } else if now > 0, old < 0 {
                    tmp += 1
                }
            } else {
                // 左へ
                let old = now
                now -= l
                if now < 0, old > 0 {
                    tmp += 1
                } else if now > 0, old < 0 {
                    tmp += 1
                }
            }
        }
        
        ans = max(ans, tmp)
    }
    
    print(ans)
}

main()

提出情報

ジャッジ結果