HDU 3486 RMQ + 二分
摘要:
算法:1.RMQ 求区间最值2.二分枚举段的数量,注意是段的数量和其和成正比,也就是枚举段的数量。View Code #include<stdio.h>#include<stdlib.h>#include<string.h>#include<iostream>#include<vector>#include<string>#include<math.h>#include<map>#include<set>#include<algorithm>using namespace s 阅读全文
posted @ 2012-08-18 17:31 more think, more gains 阅读(138) 评论(0) 推荐(0) 编辑