2020-2021:teams:hotpot:2020nowcoder10
差别
这里会显示出您选择的修订版和当前版本之间的差别。
|
2020-2021:teams:hotpot:2020nowcoder10 [2020/08/14 12:25] misakatao 创建 |
2020-2021:teams:hotpot:2020nowcoder10 [2020/08/14 13:04] (当前版本) lotk |
||
|---|---|---|---|
| 行 69: | 行 69: | ||
| ===题解=== | ===题解=== | ||
| - | ====G - ==== | + | ====G - Game==== |
| - | ===solved by === | + | ===solved by lxh=== |
| ===题意=== | ===题意=== | ||
| + | |||
| + | 给出一堆 $1 × 1$ 的积木堆起来的高度 $a_i$ ，每次操作可以将积木往前推任意次，问最小的最大高度是多少。 | ||
| ===数据范围=== | ===数据范围=== | ||
| + | |||
| + | $ 1 \le n \le 1e5$ | ||
| ===题解=== | ===题解=== | ||
| + | |||
| + | 显然，这题运用贪心的思想，我们只需要对每个前缀取平均值的上整即可。 | ||
| ====H - ==== | ====H - ==== | ||
2020-2021/teams/hotpot/2020nowcoder10.1597379119.txt.gz · 最后更改: 2020/08/14 12:25 由 misakatao
