https://111qqz.com/en/tags/%E6%96%9C%E7%8E%87%E4%BC%98%E5%8C%96/Recent content in 斜率优化 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzSun, 25 Sep 2016 16:10:49 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-25-cf455e/Sun, 25 Sep 2016 16:10:49 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-25-cf455e/<p><a href="http://codeforces.com/contest/455/problem/E" target="_blank" rel="noreferrer">题目链接</a> 题意：已知 f(1, j) = a[j] f[i][j] = min (f[i-1][j],f[i-1][j-1]) 然后给出 n n≤1E5 个数（a[i] ai≤1E4)，给出 m组查询（m&lt;=1E5），每组两个数 x,y 问 f(x,y) 是多少。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-24-hdu3507/Sat, 24 Sep 2016 16:10:18 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-24-hdu3507/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=3507" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：n个数，分成若干段，每段的代价为<figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="low" alt="" src="http://acm.hdu.edu.cn/data/images/3507-1.jpg" ></figure> ，求最小代价。</p> <p>思路：dp。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-24-e6969ce78e87e4bc98e58c96e5ada6e4b9a0e7ac94e8aeb0/Sat, 24 Sep 2016 15:38:00 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-24-e6969ce78e87e4bc98e58c96e5ada6e4b9a0e7ac94e8aeb0/<p><a href="http://www.cnblogs.com/ka200812/archive/2012/08/03/2621345.html" target="_blank" rel="noreferrer">参考博客</a></p> <p>这个东西英文好像叫做：convex hull trick</p> <p><a href="http://wcipeg.com/wiki/Convex_hull_trick" target="_blank" rel="noreferrer">Convex_hull_trick_wiki</a> <a href="http://codeforces.com/blog/entry/11339" target="_blank" rel="noreferrer">codeforces convex hull trick</a></p> <p>简单说说我的理解：斜率优化是一种数形结合的思想。。。</p>