ACM/ICPC 2019南京网络赛 B.super_log (欧拉降幂)
题目链接
缩略题目
In Complexity theory, some functions are nearly O(1)O(1), but it is greater then O(1)O(1). For example, the complexity of a typical disjoint set is O(nα(n))O(nα(n)). Here α(n)α(n) is Inverse...
原创
2019-09-03 13:37:02 ·
293 阅读 ·
0 评论