2018 Yandex.Algorithm - Qualification Round

From EOJ Wiki
Revision as of 08:08, 12 March 2018 by Ultmaster (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

ultmaster

Problem D

ultmaster 的套路:

  • 小的时候暴力,排个序。
  • 大的时候肯定可以,所以随机。

Problem F

想到不敢写,于是就错过了。ultmaster 好像不大会输出直径。

kblack

Problem D

kblack 的套路:

  • 区间有延展性,所以可以尺取。
  • 简单观察发现如果可以组成三角形,一定有大小连续的三个可以组成,插入删除复杂度可控,所以暴力维护。