HDU4737 - A Bit Fun(线段树)
摘要:
题目大意 给你一个数组a,定义f(i,j)=ai|ai+1|ai+2|⋯|aj ,|为or运算,求满足f(i,j)#include#include#include#includeusing namespace std;#define MAXN 100005#define lson l,m,s>1; build(lson); build(rson); PushUp(s);}int ... 阅读全文
posted @ 2013-09-16 20:21 仗剑奔走天涯 阅读(197) 评论(0) 推荐(0) 编辑