2020-2021:teams:hotpot:2020supplementarytraining1
|
2020-2021:teams:hotpot:2020supplementarytraining1 [2020/07/24 13:24] misakatao 创建 |
2020-2021:teams:hotpot:2020supplementarytraining1 [2020/07/24 16:27] (当前版本) misakatao 更新 |
||
|---|---|---|---|
| 行 59: | 行 59: | ||
| ===题解=== | ===题解=== | ||
| - | ====G - ==== | + | ====G - Maximum Product==== |
| - | ===solved by === | + | ===solved by gyp=== |
| ===题意=== | ===题意=== | ||
| + | |||
| + | 给出$a,b$，求$[a,b]$之间各位数字乘积最大的数 | ||
| ===数据范围=== | ===数据范围=== | ||
| + | |||
| + | $1 \le a,b \le 10^{18}$ | ||
| ===题解=== | ===题解=== | ||
| - | ====H - ==== | + | 答案一定是$b$或者是和$b$有某一个前缀相同或第一位减一后面全跟着9，一共只有几十种情况，判断一下即可 |
| - | ===solved by === | + | ====H - Biathlon 2.0==== |
| + | |||
| + | ===solved by lxh=== | ||
| ===题意=== | ===题意=== | ||
| + | |||
| + | 给出$m$对$(c_i,d_i)$，以及$n$次询问，每次询问对于$(a,b)$，哪一对$(c_i,d_i)$能最小化$a \times c_i + b \times d_i$ | ||
| ===数据范围=== | ===数据范围=== | ||
| + | |||
| + | $1 \le n,m \le 5\times 10^5$，$0 \le a_i,b_i \le 10^9$，$1 \le c_i,d_i \le 10^9$ | ||
| ===题解=== | ===题解=== | ||
| - | ====I - Investigating Legions==== | + | 把询问按照$- \frac{a}{b}$排序，相当于找一个下凸包的极值点，斜率优化dp即可解决 |
| - | ===solved by -, upsolved by tyx=== | + | ====I - ==== |
| + | |||
| + | ===solved by === | ||
| ===题意=== | ===题意=== | ||
2020-2021/teams/hotpot/2020supplementarytraining1.1595568290.txt.gz · 最后更改: 2020/07/24 13:24 由 misakatao
