【BZOJ5068】【WC2005】友好的生物（约束放宽）

Description

https://www.luogu.org/problemnew/show/P4131

---

Solution

将式子写成：$|A_{i,1}-A_{j,1}|+|A_{i,2}-A_{j,2}|+\dots$

如果没有最后的第$K$个属性，那么我们可以直接$2^{K-1}$枚举每一个绝对值的符号，由于我们要求的是答案最大，所以非法情况不可能比合法的最优解大。

如果加上第$K$个属性，我们只要对最后一个属性排序，依次插入即可。

---

Code

/************************************************
 * Au: Hany01
 * Prob: luogu4131 bzoj5068
 * Email: hany01dxx@gmail.com & hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define PB(a) push_back(a)
#define MP(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define ALL(a) a.begin(), a.end()
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
	static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 1e5 + 5, maxk = 5;

int n, k, C[maxk], ansx, ansy, id;
LL sm, mx, ans;

struct Item {
	int a[maxk], id;
}A[maxn];
inline bool cmp(Item A, Item B) { return A.a[k - 1] < B.a[k - 1]; }

int main()
{
#ifdef hany01
	freopen("bzoj5068.in", "r", stdin);
	freopen("bzoj5068.out", "w", stdout);
#endif

	n = read(), k = read();
	rep(i, k) C[i] = read();
	For(i, 1, n) {
		rep(j, k) A[i].a[j] = read() * C[j];
		A[i].id = i;
	}
	sort(A + 1, A + 1 + n, cmp);

	//1: 前-后; 0: 后-前
	rep(st, 1 << (k - 1)) {
		mx = -INF;
		For(i, 1, n) {
			if (i > 1) {
				sm = mx;
				rep(j, k - 1) sm += (st >> j & 1) ? -A[i].a[j] : A[i].a[j];
				if (chkmax(ans, sm - A[i].a[k - 1])) ansx = A[i].id, ansy = id;
			}
			sm = 0;
			rep(j, k - 1) sm += (st >> j & 1) ? A[i].a[j] : -A[i].a[j];
			if (chkmax(mx, sm + A[i].a[k - 1])) id = A[i].id;
		}
	}
	printf("%d %d\n%lld\n", ansx, ansy, ans);

	return 0;
}