water_mi's Blog
Have a good time!
首页
关于
标签
56
分类
3
归档
81
友链
站点地图
搜索
[C++]搜索优化-折半枚举,meeting in the middle
标签
CodeForces888E Maximum Subsequence(折半枚举+two-pointers)
12-24
SPOJ11469 Subset(折半枚举)
12-24