hdoj6186（前缀，后缀）

给定n个数与q次询问，每次询问一个数k，求去掉那个数后所以数的与，或，非。

递归求出每个位置的所有前缀，后缀和。

#include<bits/stdc++.h>
using namespace std;
const int sz = 100005;

int a[sz],sum1[sz],sum2[sz],sum3[sz],rsum1[sz],rsum2[sz],rsum3[sz],n,q,x;

int main(){
	while(cin>>n>>q){
		scanf("%d",&a[1]);
		sum1[1] = sum2[1] = sum3[1] = a[1];
		for(int i = 2;i<=n;++i){
			scanf("%d",&a[i]);
			sum1[i] = sum1[i-1]&a[i];
			sum2[i] = sum2[i-1]|a[i];
			sum3[i] = sum3[i-1]^a[i];
		}
		rsum1[n] = rsum2[n] = rsum3[n] = a[n];
		for(int i = n-1; i >= 1; i --){
 			rsum1[i] = rsum1[i+1] & a[i];
 			rsum2[i] = rsum2[i+1] | a[i];
 			rsum3[i] = rsum3[i+1] ^ a[i];
		}
		while(q--){
			scanf("%d",&x);
			if(x == 1) cout<<rsum1[2]<<" "<<rsum2[2]<<" "<<rsum3[2]<<endl;
			else if(x == n) cout<<rsum1[n-1]<<" "<<rsum2[n-1]<<" "<<rsum3[n-1]<<endl;
			else printf("%d %d %d\n",sum1[x-1] & rsum1[x+1],sum2[x-1]|rsum2[x+1],sum3[x-1]^rsum3[x+1]);
		}
	}
	return 0;
}