Replies: 11 comments 1 reply
-
|
上凸包和下凸包是什么啊 |
Beta Was this translation helpful? Give feedback.
-
上凸包就是凸包的上半部分,下凸包就是凸包的下半部分,23333 |
Beta Was this translation helpful? Give feedback.
-
|
例题选讲 的题面好像挂了。在我这儿看到的题面是 “令 fi 表示前 i 个物品，随意分组装在任意多个容器里所能得到的最小费用。”。我觉得这应该是正文的第一句话。 |
Beta Was this translation helpful? Give feedback.
-
|
很好很好特别好，赞赞 |
Beta Was this translation helpful? Give feedback.
-
|
写的很好. 小建议是我觉得斜率dp的解释有点不自然. 感觉考虑k_j = 2s_j, b_j = f_j + s_j^2, 然后询问这堆直线在x = L' - s_i处的最小值比较自然,就不用考虑截距之类的. 这样的话询问时递减的,反过来就行. |
Beta Was this translation helpful? Give feedback.
-
|
I think it's a good one. |
Beta Was this translation helpful? Give feedback.
-
|
能给个参考代码吗？ |
Beta Was this translation helpful? Give feedback.
-
斜率优化本来就是一种优化的技巧啊……不像数据结构什么的有一个确切的模板qwq |
Beta Was this translation helpful? Give feedback.
-
可以参考单调队列，很像，想想什么时候二分，维护凸包的时候什么时候丢弃队尾，什么时候可以直接删除队头... |
Beta Was this translation helpful? Give feedback.
-
|
例题简述式子中L,R,l,r不分，望修改 |
Beta Was this translation helpful? Give feedback.
-
|
温馨提醒，这题的单调队列不是priority_queue，指的是双端都可以维护的单调栈（ |
Beta Was this translation helpful? Give feedback.
-
|
单调队列什么时候是 priority_queue 了啊（（ /笑哭 |
Beta Was this translation helpful? Give feedback.
-
https://oi-wiki.org/dp/optimizations/convex-hull-optimization/
OI Wiki 是一个编程竞赛知识整合站点，提供有趣又实用的编程竞赛知识以及其他有帮助的内容，帮助广大编程竞赛爱好者更快更深入地学习编程竞赛
Beta Was this translation helpful? Give feedback.
All reactions