https://111qqz.com/en/tags/%E5%87%B8%E5%8C%85/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>