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. 

前缀和+后缀和，变形，上代码

import java.util.Scanner;

public class Main {
	static int n,q,p;
	static int[] a=new int[100009];
	static int[] sum1=new int[100009];
	static int[] sum2=new int[100009];
	static int[] sum3=new int[100009];
	static int[] rsum1=new int[100009];
	static int[] rsum2=new int[100009];
	static int[] rsum3=new int[100009];
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()){
			n=sc.nextInt();
			q=sc.nextInt();
			a[1]=sc.nextInt();
			sum1[1]=sum2[1]=sum3[1]=a[1];
			for(int i=2;i<=n;i++){
				a[i]=sc.nextInt();
				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];//统计异或运算的后缀和
			}
			for(int i=1;i<=q;i++){
				p=sc.nextInt();
				if(p==1){
					System.out.println(rsum1[p+1]+" "+rsum2[p+1]+" "+rsum3[p+1]);
				}else if(p==n){
					System.out.println(sum1[p-1]+" "+sum2[p-1]+" "+sum3[p-1]);
				}else{
					System.out.println((sum1[p-1]&rsum1[p+1])+" "+(sum2[p-1]|rsum2[p+1])+" "+(sum3[p-1]^rsum3[p+1]));
				}								
			}								
		}
					
	}
}

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