Asked at D.E. Shaw
Theory: Algorithms Under a Complexity BoundRead the problem, hints and solution here. The editor needs a bigger screen: open this page on a laptop to write and run your code.
x xxxxxxx xxxx xxxxxxxx xxx xxxxxxxxx x xxxxxx xxxx-xxxxxxx xx xxxxxxxx xxx xxxxx xx xxxxxxxxxxxx xxxx xxx xxxxx xxx xx xxxxx: xxx xxxxxx x xxxxx xxxxx xxxx xx xxxxxxx, xxx x xxxxx xxxxx xxx xxxxxxx xxx xxxxxxxxx xx x xxxxxx xx xxx. xxxxx xxxxxxxxxx xxx xxxxx; xxxxx xxxxxxxx xxxxxxxxxx xxx xxx xxxxxx xxx xxxx xxxxxxxx xxxxxx xxxxxxx.
xxxxx x xxxx xx xxxxxxxx xxxxxx (xxxxxxxx, xxxxxxxx, xx xxxx), xxxxxxxxx
xxxxx_xxxxxxxx_xxxxxxxxxx(xxxxxx) xxxxxxxxx xxx xxxxxx xx xxxxx xxxxx
(x < x) xxxx xxxxxx[x] >= x * xxxxxx[x].
xxxxx_xxxxxxxx_xxxxxxxxxx([x, x, x, x])
# x (xxx xxxxx (x, x) xxx (x, x); xxxx x >= x * x xxxxxx)
xxxxx_xxxxxxxx_xxxxxxxxxx([-x, -x])
# x (-x >= x * -x = -x; xxx xxxxxxxxx xx >= xxx xxxxx xxxxxx)
x <= xxx(xxxxxx) <= xxxxxx, xxxx xxxxx xxxx xx x xx-xxx xxxxxxx.>=, xx xxxxx-xxxxxxxx xxxxx xxxxx.This problem is only available to subscribers.