浙工大姗姗杯round1 A - "Or" Game |CodeForces - 578B

A - "Or" Game

  CodeForces - 578B 

time limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
You are given n numbers a1, a2, …, an. You can perform at most k operations. For each operation you can multiply one of the numbers by x. We want to make as large as possible, where denotes the bitwise OR.

Find the maximum possible value of after performing at most k operations optimally.

Input 
The first line contains three integers n, k and x (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 10, 2 ≤ x ≤ 8).

The second line contains n integers a1, a2, …, an (0 ≤ ai ≤ 109).

Output 
Output the maximum value of a bitwise OR of sequence elements after performing operations.

Examples 
input 
3 1 2 
1 1 1 
output 
3 
input 
4 2 3 
1 2 4 8 
output 
79 
Note 
For the first sample, any possible choice of doing one operation will result the same three numbers 1, 1, 2 so the result is .

For the second sample if we multiply 8 by 3 two times we’ll get 72. In this case the numbers will become 1, 2, 4, 72 so the OR value will be 79 and is the largest possible result.

题意：给n个数，再给一个x，对n个数里任意几个进行总共为k次的an*x操作，要求这n个数最后“OR”（或）结果最大。

思路：有个坑点，一开始以为乘以最大的数就可以了，果然没那么简单。借别人一个反例比如 
1 0 0 0 
1 0 1 1 
1 1 0 1 
这3个数字; 
假设要乘的数字x是2；只能乘1次; 
这三个数字依次是 
8 
11 
13 
如果把2乘最大的那个数字13 
0 1 0 0 0 
0 1 0 1 1 
1 1 0 1 0 
最后取or运算 
结果为1 1 0 1 1 
如果把2乘8 
1 0 0 0 0 
0 1 0 1 1 
0 1 1 0 1 
则再取or运算 
结果为 
1 1 1 1 1 
显然后者更大； 
所以不能单纯地就认为乘那个最大的数字就好了； 

既然如此，那就利用容斥原理，把i的前缀后缀“OR”结果都算出来，再暴力枚举，即可得出最优解。

#include<iostream>
using namespace std;
long long n,k,x;
long long p[200005], q[200005], a[200005];
int main()
{
	cin >> n >> k >> x;
	for(int i = 1;i <= n;i++)
	{
		cin >> a[i];
		p[i] = p[i-1]|a[i];
	}
	for(int i = n; i >= 1; i--)
	{
		q[i] = q[i+1]|a[i];
	}
	long long maxn=-1;
	for(int i = 1; i <= n; i++)
	{
		long long temp = a[i];
		for(int j = 0; j < k; j++)
		{
			temp *= x;
		}
		temp = temp|p[i-1]|q[i+1];
		maxn = max(maxn, temp);
	}
	cout << maxn << endl;
	return 0;
}