萌新求助复杂度分析

P3911 最小公倍数之和

大概是 $O(N\ln^2 N)$ 吧 @[S0CRiA](/user/390770)
by forest114514 @ 2024-01-31 19:31:14


大概两log,枚举i后j,k个数为调和级数1log,i,j*k个数和同上也约有1log
by sunkaihuan @ 2024-01-31 19:35:34


还有qndmx
by sunkaihuan @ 2024-01-31 19:35:54


@[forest114514](/user/320449) @[sunkaihuan](/user/504535) 谢谢
by S0CRiA @ 2024-01-31 19:36:13


|