Open ManuShi98 opened 11 months ago
https://manushi98.github.io/2018/01/26/HDU%20-%205536%20Chip%20Factory/
思路字典树异或,题意是n个数选出3个使得(si+sj)^sk的值最大,我们对每个数构造01字典树,然后暴力枚举si,sj求和后直接在字典树上贪心。注意要在字典树上删除si和sj避免计算自己(可以使用lazy策略)。时间复杂度O(30*n^2)
https://manushi98.github.io/2018/01/26/HDU%20-%205536%20Chip%20Factory/
思路字典树异或,题意是n个数选出3个使得(si+sj)^sk的值最大,我们对每个数构造01字典树,然后暴力枚举si,sj求和后直接在字典树上贪心。注意要在字典树上删除si和sj避免计算自己(可以使用lazy策略)。时间复杂度O(30*n^2)