hdu6186 CS Course (维护前缀和和后缀和)

Little A has come to college and majored in Computer and Science. 

Today he has learned bit-operations in Algorithm Lessons, and he got a problem as homework. 

Here is the problem: 

You are giving n non-negative integers a1,a2,⋯,ana1,a2,⋯,an, and some queries. 

A query only contains a positive integer p, which means you 
are asked to answer the result of bit-operations (and, or, xor) of all the integers except apap. 

Input

There are no more than 15 test cases. 

Each test case begins with two positive integers n and p 
in a line, indicate the number of positive integers and the number of queries. 

2≤n,q≤1052≤n,q≤105 

Then n non-negative integers a1,a2,⋯,ana1,a2,⋯,an follows in a line, 0≤ai≤1090≤ai≤109 for each i in range[1,n]. 

After that there are q positive integers p1,p2,⋯,pqp1,p2,⋯,pqin q lines, 1≤pi≤n1≤pi≤n for each i in range[1,q].

Output

For each query p, output three non-negative integers indicates the result of bit-operations(and, or, xor) of all non-negative integers except apap in a line. 

Sample Input

3 3
1 1 1
1
2
3

Sample Output

1 1 0
1 1 0
1 1 0

代码： 

import java.util.Scanner;

public class main21 {
   public static void main(String[] args) {
	    final int max=100005;
	    int a[]=new int[max];
	    int sa[]=new int[max];
	    int sb[]=new int[max];
	    int sc[]=new int[max];
	    int ea[]=new int[max];
	    int eb[]=new int[max];
	    int ec[]=new int[max];
	    Scanner scan=new Scanner(System.in);
        while(scan.hasNext()){
        	int n=scan.nextInt();
    	    int q=scan.nextInt();
	        for(int i=1;i<=n;i++){
	    	   a[i]=scan.nextInt();
	        }
	        sa[1]=sb[1]=sc[1]=a[1];
	        for(int i=2;i<=n;i++){
	        	sa[i]=sa[i-1]&a[i];
	        	sb[i]=sb[i-1]|a[i];
	        	sc[i]=sc[i-1]^a[i];
	        }
	        ea[n]=eb[n]=ec[n]=a[n];
	        for(int i=n-1;i>0;i--){
	        	ea[i]=ea[i+1]&a[i];
	        	eb[i]=eb[i+1]|a[i];
	        	ec[i]=ec[i+1]^a[i];
	        }
	        while(q>0){
	        	int p=scan.nextInt();
	        	if(p==1){
	        		System.out.println(ea[2]+" "+eb[2]+" "+ec[2]);
	        	}
	        	else if(p==n){
	        		System.out.println(sa[n-1]+" "+sb[n-1]+" "+sc[n-1]);
	        	}
	        	else{
	        		System.out.println((sa[p-1]&ea[p+1])+" "+(sb[p-1]|eb[p+1])+" "+(sc[p-1]^ec[p+1]));
	        	}
	        	q--;
	        }
        }
}
}