Submission #2555512

---

Source Code Expand

D=gets.to_i.times.map{gets.to_i}

x=l=h=0
D.each do |d|
  x+=d
  l=[l,x].min
  h=[h,x].max
end
p h-l

case D.size
  when 1
    p D[0]
  when 2
    p D.inject(:-).abs
  else
    p D.combination(3).map{|a,b,c|
      a,b,c=[a,b,c].sort
      [0,c-a-b].max
    }.min
end

Submission Info

Judge Result