Fawkess的博客

通过分治的剪枝，O(n2)的算法运行时间竟然接近O(n*lgn)？？？#include <iostream>#include <cstdio>#include <iomanip>#include <string>#include <cstdlib>#include <cstring>#include <queue>#include <set>#include <vector>#in

Today, as a friendship gift, Bakry gave Badawy n integers a1,a2,…,an and challenged him to choose an integer X such that the value max1≤i≤n(ai⊕X).is minimum possible, where ⊕ denotes the bitwise XOR o...