算法-分治
FawkesLi
这个作者很懒,什么都没留下…
展开
-
poj 3714分治
通过分治的剪枝,O(n2)的算法运行时间竟然接近O(n*lgn)??? #include <iostream> #include <cstdio> #include <iomanip> #include <string> #include <cstdlib> #include <cstring> #include <queue> #include <set> #include <vector> #in转载 2020-05-16 23:05:19 · 182 阅读 · 0 评论 -
cf 613.D(分治+暴力)
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...原创 2020-01-11 10:34:47 · 302 阅读 · 0 评论