B. Cobb

Problem - 1554B - Codeforces

题意：给出一个数k,1<=k<=min(n,100)给定一个数组a，要求找出1<=i<j<=n，使得i*j-k*(a[[i]|a[j])最大，0<=a[i]<=n。

思路：如果直接想的话，很容易掉进题目陷阱，我们应当首先注意到k，ai的奇怪数据范围限制，并把它们转化为能够使用的条件，计算一下公式我们就会发现i*j-k*2*n<=i*j-k*(a[i]|a[j])<=i*j，需要注意的是此处乘2是因为或运算

于是我们做这样的转换，计算边界情况，n*(n-1)-2*k*n=>n*(n-2k-1)，于是时间复杂度就从n*n降到了k*k*4

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>

#define int ll
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0);
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 300010, M = 2 * N, B = N, MOD = 998244353;
const double eps = 1e-7;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;

int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
//int dx[8] = { 1,2,2,1,-1,-2,-2,-1 }, dy[8] = { 2,1,-1,-2,-2,-1,1,2 };
int n, m, k;
int a[N];

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll MOD) {
	ll res = 1;
	while (b) {
		if (b & 1) res = res * a % MOD;
		a = a * a % MOD;
		b >>= 1;
	}
	return res;
}

inline void init() {}

inline void slove()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> a[i];

	int ans = -INF;
	for (int i = max(1ll,n - 2 * m - 1); i <= n; i++)
		for (int j = i + 1; j <= n; j++)
			ans = max(ans, i * j - m * (a[i] | a[j]));

	cout << ans << endl;
} 

signed main()
{
	//IOS;
	int _ = 1;
	si(_);
	init();
	while (_--)
	{
		slove();
	}
	return 0;
}
/*
1
6 6
5 5 5 5 5 5

*/