题目链接:http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1674
比赛的时候耗尽千辛万苦才切出来。。我觉得要切出这道题,肯定要对位运算的性质有些了解。。
因为是and或者or,我们发现,无论是哪个,变化情况种数最多不超过30种,所以总共不超过60种。这也就代表着,在区间里肯定有一些区间内的答案是一样的,我们对于这样的区间,固定左端点,二分右端点。所以时间复杂度是O(60*NLOGN)
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 1e5+5;
typedef long long ll;
const ll mod = 1000000007;
ll dp[N][25][2];
ll a[N];
int bitx[N];
void ST(int n) {
for(int i = 1; i <= n; ++i) {
dp[i][0][0] = dp[i][0][1] = a[i];
}
for(int j = 1; (1<<j) <= n; ++j) {
for(int i = 1; i+(1<<j)-1 <= n; ++i) {
dp[i][j][0] = dp[i][j-1][0]&dp[i+(1<<(j-1))][j-1][0];
dp[i][j][1] = dp[i][j-1][1]|dp[i+(1<<(j-1))][j-1][1];
}
}
bitx[1] = 0;
for(int i = 2; i <= n; ++i) {
if(i&(i-1)) bitx[i] = bitx[i-1];
else bitx[i] = bitx[i>>1]+1;
}
}
ll queryand(int l, int r) {
int k = bitx[r-l+1];
return dp[l][k][0]&dp[r-(1<<k)+1][k][0];
}
ll queryor(int l, int r) {
int k = bitx[r-l+1];
return dp[l][k][1]|dp[r-(1<<k)+1][k][1];
}
int main(int argc, const char * argv[]) {
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i) {
scanf("%lld", a+i);
}
ST(n);
ll ans = 0;
for(int i = 1; i <= n; ++i) {
ll lastand = a[i], lastor = a[i]; int lastpos = i;
while(lastpos <= n) {
int l = lastpos, r = n;
int ansand = n, ansor = n;
while(l <= r) {
int mid = (l+r) >> 1;
if(queryand(i, mid) == lastand) l = mid+1, ansand = mid;
else r = mid-1;
}
l = lastpos, r = n;
while(l <= r) {
int mid = (l+r) >> 1;
if(queryor(i, mid) == lastor) l = mid+1, ansor = mid;
else r = mid-1;
}
int pos = min(ansand, ansor);
ans = (ans+(pos-lastpos+1)*lastand%mod*lastor%mod)%mod;
if(pos == n) break;
lastpos = pos+1; lastor = queryor(i, pos+1); lastand = queryand(i, pos+1);
}
}
printf("%lld\n", ans);
return 0;
}