Difference between revisions of "2018 Multi-University, Nowcoder Day 3"

From EOJ Wiki
Jump to navigation Jump to search
(Created page with "== Problem A == Solved by kblack. 01:16 (+1) == Problem B == Unsolved. (-2) == Problem C == Solved by zerol. 00:45 (+) == Problem D == Unsolved. (-6) == Problem E ==...")
 
Line 10: Line 10:
  
 
Solved by zerol. 00:45 (+)
 
Solved by zerol. 00:45 (+)
 +
 +
题意:每次把数列中一个区间的数剪切到数列的开头,最后打印这个数列。
 +
 +
题解:模板题。treap / splay / rope(pb_ds)
  
 
== Problem D ==
 
== Problem D ==

Revision as of 11:19, 26 July 2018

Problem A

Solved by kblack. 01:16 (+1)

Problem B

Unsolved. (-2)

Problem C

Solved by zerol. 00:45 (+)

题意:每次把数列中一个区间的数剪切到数列的开头,最后打印这个数列。

题解:模板题。treap / splay / rope(pb_ds)

Problem D

Unsolved. (-6)

Problem E

Solved by ultmaster. 00:49 (+)

Problem H

Solved by kblack. 00:19 (+)

Problem I

Solved by ultmaster. 04:24 (+)

Problem J

Solved by ultmaster. 02:51 (+)