Difference between revisions of "2018 Multi-University, Nowcoder Day 10"
Jump to navigation
Jump to search
(Created page with "== Problem A == Solved by kblack. 00:23 (+) == Problem D == Solved by ultmaster. 01:20 (+1) == Problem F == Solved by kblack. 03:33 (+) == Problem J == Solved by zerol...") |
|||
| Line 6: | Line 6: | ||
Solved by ultmaster. 01:20 (+1) | Solved by ultmaster. 01:20 (+1) | ||
| + | |||
| + | 题意：有三种操作，区间加，对整个序列求前缀和，求区间和。第三种操作不会超过 500 个。 | ||
| + | |||
| + | 题解：考虑每次区间加对答案的贡献都是独立的，对每次询问，分别计算每个区间加对答案的贡献即可。区间加的贡献可以拆成一个 (l, +w) 的贡献和一个 (r, -w) 的贡献。对于每个 w，只要稍微推导一下很容易看到是一个组合数。 | ||
== Problem F == | == Problem F == | ||
Revision as of 08:39, 19 August 2018
Problem A
Solved by kblack. 00:23 (+)
Problem D
Solved by ultmaster. 01:20 (+1)
题意：有三种操作，区间加，对整个序列求前缀和，求区间和。第三种操作不会超过 500 个。
题解：考虑每次区间加对答案的贡献都是独立的，对每次询问，分别计算每个区间加对答案的贡献即可。区间加的贡献可以拆成一个 (l, +w) 的贡献和一个 (r, -w) 的贡献。对于每个 w，只要稍微推导一下很容易看到是一个组合数。
Problem F
Solved by kblack. 03:33 (+)
Problem J
Solved by zerol | kblack. 00:27 (-1/+) | 01:25 (+)