摘要：
A variantion to "largest\smallest consecutive subarray". Idea is, at position i, the current max diff is max(max_left[i] - min_right[i+1], max_right[i... 阅读全文
posted @ 2015-10-18 12:57
Tonix
阅读(151)
评论(0)
推荐(0)
浙公网安备 33010602011771号