这题数据是不是太水了呀，，

P3806 【模板】点分治 1

ZhuMingYang @ 2019-10-24 22:18:59

O(nm)无脑dp都可以过

还有 把k\le10^7的值全部求出O(1)回答的点分治都能过（我的就是）

似乎复杂度很高

by HRLYB @ 2019-10-24 22:27:42

%%%%%%%

话说这两天见你有点多233

by ZhuMingYang @ 2019-10-24 22:29:36

@HRLYB 没事干天天水讨论

by bellmanford @ 2019-11-09 18:01:09

\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because\therefore \because

by bellmanford @ 2019-11-09 18:01:44

\therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore \therefore

by bellmanford @ 2019-11-09 18:02:54

by bellmanford @ 2019-11-09 18:06:25

o^{r^{z^{o^{r^z}}}}

by 万弘 @ 2020-01-31 23:24:28

@ZhuMingYang 那个暴力求所有k\le 10^7是否存在的时间复杂度明显是假的。。

T(n)=T(n/2)+O(n^2)=O(n^2)

注：这里的2不是指儿子数一定是2，而是指最坏情况下是2

并且这个O(n^2)常数不小，刻意构造下就T了。

另，好多题解都是假的。。此题正解应该是O(nlog^2n+mnlogn)

by 万弘 @ 2020-01-31 23:25:08

@ZhuMingYang 另，dp咋做啊

|