题解 | #暴力出奇迹#

暴力枚举最高位，将其分成数个子序列，各个子序列分别计算最大值 代码

void solve(){
int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
 
    ll ans = 0;
    for (int i = 0; i <= 21; i++) {
        ll sum = 0, tmp = (1 << (21)) - 1;
        for (int j = 1; j <= n; j++) {
            if (a[j] >> i & 1) {
                sum += a[j];
                tmp &= a[j];
                ans = max(ans, sum * tmp);
            } else {
                sum = 0;
                tmp = (1 << (21)) - 1;
            }
        }
    }
    cout << ans << endl;
}