2017ACM/ICPC广西邀请赛 CS Course

题意：删除指定数字，求剩下数字的与或非值

解法：保存一下前缀和后缀

 #include <iostream>
 #include <stdio.h>
 #include <vector>
 #include <string.h>
 #include <map>
 using namespace std;
 int x1[],y1[],z1[];
 int x2[],y2[],z2[];
 int num[];
 map<int,int>Mp;
 int n,m;
 map<int,int>::iterator it;
 int main(){
     while(~scanf("%d%d",&n,&m)){
         memset(x1,,sizeof(x1));
         memset(y1,,sizeof(y1));
         memset(z1,,sizeof(z1));
         memset(x2,,sizeof(x2));
         memset(y2,,sizeof(y2));
         memset(z2,,sizeof(z2));
         for(int i=;i<=n;i++){
             scanf("%d",&num[i]);
         }
         x1[]=num[];
         x2[n-]=num[n];
         y1[]=num[];
         y2[n-]=num[n];
         z1[]=num[];
         z2[n-]=num[n];
         for(int i=;i<=n;i++){
             x1[i]=x1[i-]^num[i-];
         }
         for(int i=n-;i>=;i--){
             x2[i]=x2[i+]^num[i+];
         }
         for(int i=;i<=n;i++){
             y1[i]=y1[i-]|num[i-];
         }
         for(int i=n-;i>=;i--){
             y2[i]=y2[i+]|num[i+];
         }
         for(int i=;i<=n;i++){
             z1[i]=z1[i-]&num[i-];
         }
         for(int i=n-;i>=;i--){
             z2[i]=z2[i+]&num[i+];
         }
         while(m--){
             int ans;
             scanf("%d",&ans);
             if(ans==){
                 printf("%d %d %d\n",z2[ans],y2[ans],x2[ans]);
             }else if(ans==n){
                 printf("%d %d %d\n",z1[ans],y1[ans],x1[ans]);
             }else{
                 printf("%d %d %d\n",z2[ans]&z1[ans],y2[ans]|y1[ans],x2[ans]^x1[ans]);
             }
         }
     }
     return ;
 }