[NOIpTG2014]联合权值——[简单数学+模拟]

【题意分析】

这道题的idea炒鸡妙啊

首先枚举点是显然不可取的，那么我们换种思路——枚举那个中间点。

两个值$a,b$距离为2，那么会产生$2ab$的权值（数对是有序的）

那么就相当于这个中间点连着两个值，如果连着三个呢？

答案就是$2ab+2ac+2bc$，发现什么没有？

$$2ab=(a+b{)}^2-(a^2+b^2)$$

$$2ab+2ac+2bc=(a+b+c{)}^2-(a^2+b^2+c^2)$$

由此我们推测

$$2ab+2ac+2ad+2bc+2bd+2cd=(a+b+c+d{)}^2-(a^2+b^2+c^2+d^2)$$

还真的是这样的，所以一个中间点的联合权值

$$\sum _{i<j}2a_i{a}_j=(\sum _{i=1}^n{a}_i{)}^2-\sum _{i=1}^n{a}_i^2$$

说人话，只要枚举每个中间点，联合权值就是周围的点和的平方减去平方的和

接下来模拟就好了

Code：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
#define int long long
#define qy 10007
#define MAXN 300000
using namespace std;

struct fls {
	int to, next;
}edge[MAXN << 1];

int head[MAXN << 1], a[MAXN], n, cnt, ans = 0, Max = 0;

inline int read () {
	register int s = 0, w = 1;
	register char ch = getchar ();
	while (! isdigit (ch)) {if (ch == '-') w = -1; ch = getchar ();}
	while (isdigit (ch)) {s = (s << 3) + (s << 1) + (ch ^ 48); ch = getchar ();}
	return s * w;
}

inline void connect (int u, int v) {
	edge[++cnt].to = v, edge[cnt].next = head[u], head[u] = cnt;
}

signed main () {
	n = read ();
	for (register int i = 1; i < n; i++) {
		int u = read (), v = read ();
		connect (u, v), connect (v, u);
	}
	for (register int i = 1; i <= n; i++) a[i] = read ();
	for (register int i = 1; i <= n; i++) {
		int sum1 = 0, sum2 = 0, max1 = 0, max2 = 0;
		for (register int j = head[i]; j; j = edge[j].next) {
			int v = edge[j].to;
			if (a[v] > max1) max2 = max1, max1 = a[v];
			else if (a[v] > max2) max2 = a[v];
			(sum1 += a[v]) %= qy, (sum2 += a[v] * a[v]) %= qy;
		}
		(sum1 *= sum1) %= qy; ans = (((ans + sum1) % qy - sum2) % qy + qy) % qy;
		Max = max (Max, max1 * max2);
	}
	return printf ("%lld %lld\n", Max, ans), 0;
}