摘要：
Really interesting problem. Naive solution would be O(n^3). But please note the pattern here: (i, j, k) -> (i + 1, j + 1, k) -> (i + 2, j + 2, k)... t... 阅读全文
posted @ 2015-05-08 07:23
Tonix
阅读(469)
评论(0)
推荐(0)
浙公网安备 33010602011771号