POJ3666 O(nlogn)根据数学特征使用单调队列完全代替dp o(n^2)解法
求一个距离a最小的单增序列b,a[i]严格单调增等价于a[i]-i的不减(不严格单调增)以下是在大佬的博客里看到的(大佬从cf评论区搬运加注释的)There is a very short (10 lines!) and fast O(nlgn) solution for Div1C, proposed by woqja125 :Start by subtracting i from all...
转载
2020-02-23 22:10:49 ·
179 阅读 ·
0 评论