2018 Multi-University,Nowcoder Day 10

From EOJ Wiki
Jump to navigation Jump to search

Problem A

Solved by

题意：

题解：

Problem B

Solved by

题意：

题解：

Problem C

Unsolved.

题意：

题解：

Problem D

Solved.

题意：三个操作，一个操作是求区间和，一个操作是做区间加，另一个操作是把数列的每一位变成前缀和。

题解：询问只有500个，直接暴力即可，细节比较多。

Problem E

Upsolved by

题意：

题解：

Problem F

Solved by

题意：

题解：

Problem G

Unsolved.

题意：

题解：

Problem H

Unsolved.

题意：

题解：

Problem I

Solved by

题意：

题解：

Problem J

Solved by

题意：

题解：

Problem K

Solved by

题意：

题解：

Retrieved from "http://acm.ecnu.edu.cn/wiki/index.php?title=2018_Multi-University,Nowcoder_Day_10&oldid=899"