https://qoj.ac/submission/2150825
原做法询问次数据说是 $5n+3\log_2 n$
QOJ.ac
QOJ
Discussion #1317 for Problem #189. I 君的商店
Type: Editorial
Status: Open
Posted by: incent
Posted at: 2026-03-21 07:14:03
Last updated: 2026-03-21 07:17:28
询问次数 5n 的做法
Comments
No comments yet.