摘要:
Ping pong Description N (3 ≤ N ≤ 20000) ping pong players live along a west-east street(consider the street as a line segment). Each player has a uniq 阅读全文
posted @ 2016-07-29 01:00
季末Despair
阅读(169)
评论(0)
推荐(0)
摘要:
K Smallest Sums Description You’re given k arrays, each array has k integers. There are k k ways to pick exactly one element in each array and calcula 阅读全文
posted @ 2016-07-29 00:08
季末Despair
阅读(189)
评论(0)
推荐(0)

浙公网安备 33010602011771号