2018
J.Philosophical … Balance
题意：给定一个长为 n 的字符串，记 s_i 为从 i 开始的后缀，求：
![\[\max_{\{p_i\}}\left(\min_{j=1}^{n}\left(\sum_{i=1}^{n} p_i \operatorname{lcp}(s_i,s_j)\right)\right)\]](https://www.shuizilong.com/house/wp-content/ql-cache/quicklatex.com-2f76618d2088a30df03fcf6f68fd0604_l3.png "Rendered by QuickLaTeX.com")
n ≤ 2×10^5
做法：lcp + 纳什均衡
 |
 |
||||||||||||
|
|||||||||||||
 |
 |
 |
某岛
… : "…アッカリ～ン . .. . " .. .
|
 |