hdu 4737 线段树维护+二分

线段树维护从i到j  或的值，然后对于每一个i 二分最大j （满足单调性）  i-j 所有小于m 总复杂度为（n*log(n)*log*(n)）我是找大于等于m的最小数，在整个数组最后插入个超大的数。貌似复杂度比较大，c++飘过，想到了多30数组能不用线段树维护了，常数可能会小

#include <cstdio>
#include <iostream>
#include <algorithm>
#define ll int
#define lson i<<1
#define rson i<<1|1
using namespace std;
ll const M = 100000+9;
ll inf = (1<<30)+55;
struct node {
 ll left;
 ll right;
 ll val;
}tree[M<<2];
ll a[M];
void build(ll l,ll r,ll i){
  tree[i].left = l;
  tree[i].right = r;
  if(l==r) {
   tree[i].val = a[l];
   return ;
  }
  ll mid = (l+r) >>1;
  build(l,mid,lson);
  build(mid+1,r,rson);
  tree[i].val= tree[lson].val|tree[rson].val;
}
ll query(ll l,ll r,ll i){
 if(tree[i].left==l&&tree[i].right==r) {
  return tree[i].val;
 }
 ll mid=(tree[i].left + tree[i].right) >>1;
 if(r<=mid) return query(l,r,lson);
 else if(l>mid) return query(l,r,rson);
 else return query(l,mid,lson)|query(mid+1,r,rson);
}
ll bin(ll l,ll r,ll k){
    ll tmin;
    tmin=inf;
    ll u=l;
  while(l<=r){
  ll mid =(l+r) >>1;
  ll o= query(u,mid,1);
  if(o<k) {
   l=mid+1;
  }
  else{
    tmin=mid;
    r=mid-1;
  }
 }
 return tmin;
}
int main(){
  ll T;
  ll u=1;
  //printf("%d\n",(1<<30)-inf);
  cin>>T;
  while(T--){
   ll n,m;
   cin>>n>>m;
   for(ll i=1;i<=n;i++)
   scanf("%d",a+i);
   a[n+1]=inf;
   build(1,n+1,1);
   __int64 ans=0;
   for(ll i=1;i<=n;i++){
    if(a[i]>=m) continue;
    ll p=bin(i,n+1,m);
    ans+=(p-i);
   }
   printf("Case #%d: %I64d\n",u++,ans);
  }
}