摘要: first, i use exhausitive search. however, it will exceed the time limit. the time speed is O(n^2) then, i change the strategy. for impove the speed, I 阅读全文
posted @ 2017-07-18 18:24 hahahaf 阅读(187) 评论(0) 推荐(0)