这里会显示出您选择的修订版和当前版本之间的差别。
两侧同时换到之前的修订记录 前一修订版 | |||
2020-2021:teams:i_dont_know_png:saratovsu2015 [2020/08/07 17:05] potassium FHK |
2020-2021:teams:i_dont_know_png:saratovsu2015 [2020/08/15 18:09] (当前版本) nikkukun add G |
||
---|---|---|---|
行 3: | 行 3: | ||
[[https://codeforces.com/group/azDPdoF24f/contest/288496 | 比赛链接]] | [[https://codeforces.com/group/azDPdoF24f/contest/288496 | 比赛链接]] | ||
- | ===== A - Three Servers ===== | + | ===== A - Three Servers ===== |
Solved by qxforever. | Solved by qxforever. | ||
行 24: | 行 24: | ||
- | ===== F - Empty Vessels ===== | + | ===== F - Empty Vessels ===== |
Solved by Potassium. | Solved by Potassium. | ||
行 42: | 行 42: | ||
- | ===== H - Biathlon 2.0 ===== | + | |
+ | |||
+ | |||
+ | ===== G. Maximum Product ===== | ||
+ | |||
+ | Solved by nikkukun. | ||
+ | |||
+ | 水题不表。 | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | ===== H - Biathlon 2.0 ===== | ||
Solved by nikkukun & Potassium. | Solved by nikkukun & Potassium. | ||
行 48: | 行 60: | ||
==== 题目描述 ==== | ==== 题目描述 ==== | ||
- | 给 $5e5$ 个数对 $(x,y)$ ,和 $5e5$ 个数对 $(a,b)$ 。 对于每个 $(a,b)$ 找出 $ax+by$ 最小值。 | + | 给 $5 \times 10^5$ 个数对 $(x,y)$ ,和 $5 \times 10^5$ 个数对 $(a,b)$ 。 对于每个 $(a,b)$ 找出 $ax+by$ 最小值。 |
==== 解题思路 ==== | ==== 解题思路 ==== | ||
行 57: | 行 69: | ||
- | ===== K - Toll Roads ===== | + | ===== K - Toll Roads ===== |
Upsolved by Potassium. | Upsolved by Potassium. |