有没有佬提供一点思路,怎么把时间复杂度降下去

题目总版

题目: https://www.luogu.com.cn/problem/T446622
by wanttoac @ 2024-04-20 00:57:44


@[wanttoac](/user/1258100) 枚举显然不可能了,枚举子集是 $O(n^2)$ 的,Hard Version有原题,[this](https://www.luogu.com.cn/problem/P4062)
by Li_Yichen @ 2024-04-20 06:51:12


@[wanttoac](/user/1258100) 整体的思想是不变的,判断条件变了一点
by Li_Yichen @ 2024-04-20 06:52:10


|