2018 Multi-University,Nowcoder Day 9

From EOJ Wiki
Jump to navigation Jump to search

Problem A

Solved by

题意:

题解:

Problem B

Solved by

题意:

题解:

Problem C

Unsolved.

题意:

题解:

Problem D

Unsolved.

题意:

题解:

Problem E

Upsolved by

题意:

题解:

Problem F

Solved by

题意:

题解:

Problem G

Unsolved.

题意:

题解:

Problem H

Solved.

题意:单点加,求 n 次二维前缀和。

题解:对操作分块操作,每个块内暴力一起做,似乎比赛的时候块的大小不太好,TLE了。手动定义每一个块的大小为2000即可。

Problem I

Solved by

题意:

题解:

Problem J

Solved by

题意:

题解:

Problem K

Solved by

题意:

题解: