Codeforces Round #320 (Div. 2)(D)

“Or” Game
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.

Sample test(s)
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.

一开始使用的贪心做的，直接让最大的数操作k次。但是错了，没有考虑这个数据
3 1 2
2 4 5
我的结果：14
正确结果：15
后面用dp做的以为对了，但是没想到有后效性。每次做dp题时都没有考虑有没有后效性。
dp[i][j]表示前i个数操作j次的最大值，转移方程dp[i][j] = max(dp[i-1][j-cnt]|tmp, dp[i][j]);（0<=cnt<=j，tmp=a[i]*x^cnt）
这组数据就过不了
3 1 2
17 18 4
我的结果：53
正确结果：54

操作k次肯定是操作在一个数上。
直接对a[i]操作k次（1<=i<=n），这就有n个值取其中的最大值。
直接模拟O(n^2)肯定会超时，我们要求的数是a[1]|a[2]|…|a[i]*x^k|a[i+1]|…|a[n]
a[1]|a[2]|a[3]|…|a[i]和a[i+1]|a[i+2]|…|a[n]可以预处理

#include<iostream>
#include<cstdio>
using namespace std;

const int N = 200010;
long long a[N];//输入的序列
long long b[N];//b[i]表示a[i]*x^k
long long l[N];//l[i]表示a[i]|a[i+1]|a[i+2]|...|a[n]的值
long long r[N];//r[i]表示a[1]|a[2]|a[3]|...|a[i]的值

int main(void)
{
    int n, k, x;
    int i, j;
    while(~scanf("%d%d%d", &n, &k, &x))
    {
        long long ans = 0;
        for(i = 1; i <= n; i++)
        {
            scanf("%I64d", &a[i]);
            int tmp = k;
            b[i] = a[i];
            while(tmp--)
            {
                b[i] *= x;
            }
        }
        r[0] = 0;l[n+1] = 0;
        for(i = 1; i <= n; i++)
            r[i] = r[i-1]|a[i];
        for(i = n; i > 0; i--)
            l[i] = l[i+1]|a[i];

        for(i = 1; i <= n; i++)
        {
            b[i] = r[i-1]|b[i];
            b[i] = l[i+1]|b[i];
            if(ans < b[i]) ans = b[i];
        }
        printf("%I64d\n", ans);
    }
    return 0;
}