CS Course HDU - 6186(位运算，前后缀巧用)

CS Course

题目链接：HDU - 6186

题意：一个数列，分别求出该数列去掉一个数后剩余数的&，|，^运算结果；

思路：^简单，先预处理所有值的^,然后去掉谁^谁：a^b^a=b;

对&，|运算都预处理前缀和后缀，去掉谁，就对应的&，|他的前后缀；

#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+100;
int n, q, a[maxn], pre_and[maxn], suf_and[maxn], pre_or[maxn], suf_or[maxn];
int main(){
	while(~scanf("%d%d", &n, &q)){
		int _xor=0;
		for(int i=1; i<=n; i++){
			scanf("%d", &a[i]);
			_xor^=a[i];
		}
		pre_and[0]=(1 << 31) - 1;
		suf_and[n+1]=(1 << 31) - 1;
		pre_or[0]=suf_or[n+1]=0;
		for(int i=1; i<=n; i++){
			pre_and[i]=pre_and[i-1]&a[i];
			pre_or[i]=pre_or[i-1]|a[i];
		}
		for(int i=n; i>0; i--){
			suf_and[i]=suf_and[i+1]&a[i];
			suf_or[i]=suf_or[i+1]|a[i];
		}
	
		while(q--){
			int p;
			scanf("%d", &p);
			printf("%d %d %d\n", pre_and[p-1]&suf_and[p+1], pre_or[p-1]|suf_or[p+1], _xor^a[p]);
		}
	}
	return 0;
}