Difference between revisions of "2018 Multi-University,Nowcoder Day 10"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
Xiejiadong (talk | contribs) |
||
Line 1: | Line 1: | ||
== Problem A == | == Problem A == | ||
− | Solved | + | Solved. |
题意: | 题意: | ||
Line 9: | Line 9: | ||
== Problem B == | == Problem B == | ||
− | + | Unsolved. | |
题意: | 题意: | ||
Line 33: | Line 33: | ||
== Problem E == | == Problem E == | ||
− | + | Solved. | |
题意: | 题意: | ||
Line 40: | Line 40: | ||
== Problem F == | == Problem F == | ||
− | Solved | + | Solved. |
题意: | 题意: | ||
Line 64: | Line 64: | ||
== Problem I == | == Problem I == | ||
− | + | Unolved. | |
题意: | 题意: | ||
Line 72: | Line 72: | ||
== Problem J == | == Problem J == | ||
− | Solved | + | Solved. |
题意: | 题意: | ||
Line 80: | Line 80: | ||
== Problem K == | == Problem K == | ||
− | + | Unsolved. | |
题意: | 题意: | ||
题解: | 题解: |
Latest revision as of 07:36, 24 August 2018
Problem A
Solved.
题意:
题解:
Problem B
Unsolved.
题意:
题解:
Problem C
Unsolved.
题意:
题解:
Problem D
Solved.
题意:三个操作,一个操作是求区间和,一个操作是做区间加,另一个操作是把数列的每一位变成前缀和。
题解:询问只有500个,直接暴力即可,细节比较多。
Problem E
Solved.
题意:
题解:
Problem F
Solved.
题意:
题解:
Problem G
Unsolved.
题意:
题解:
Problem H
Unsolved.
题意:
题解:
Problem I
Unolved.
题意:
题解:
Problem J
Solved.
题意:
题解:
Problem K
Unsolved.
题意:
题解: