随笔分类 -  d单调队列优化

摘要:思路: 首先考虑n^2暴力枚举:ans[i]=max(a[j]+sqrt(|i-j|)-a[i] (1<=j<=n) 把绝对值拆开: ans[i]=max(a[j]+sqrt(i-j))-a[i] (1<=j<=i) ans[i]=max(a[j]+sqrt(j-i))-a[i] (i<j<=n) 阅读全文
posted @ 2021-02-24 21:58 yxr~ 阅读(63) 评论(0) 推荐(0)