摘要: https://codeforces.com/contest/320/problem/E 斜率优化dp https://codeforces.com/contest/631/problem/E 单调栈维护一个决策凸包,二分。 int n; ll a[200005]; ll sum[200005]; 阅读全文
posted @ 2021-03-04 01:24 purinliang 阅读(48) 评论(0) 推荐(0)