题目链接
解题思路
一看到
我们就要反应出来:G是一颗树。
两个点的距离为2,就能产生联合权值?
那我枚举中间点不就好了2333
一个中间点的最大联合权值就是它所连的点中权值最大的两个点(如果它所连只有一个点,自然不产生权值)。考虑它的所有的联合权值之和怎么算
第
k
k
k个点为中间点的所有联合权值之和
a
n
s
[
k
]
=
∑
v
i
∑
v
j
!
=
v
i
w
[
v
i
]
∗
w
[
v
j
]
ans[k]=\sum_{v_i}\sum_{v_j!=v_i}w[v_i]*w[v_j]
ans[k]=vi∑vj!=vi∑w[vi]∗w[vj]
其中
v
i
,
v
j
v_i,v_j
vi,vj是
k
k
k所连的点
继续变形,得
a
n
s
[
k
]
=
∑
v
i
w
[
v
i
]
∗
∑
v
j
!
=
v
i
w
[
v
j
]
ans[k]=\sum_{v_i}w[v_i]*\sum_{v_j!=v_i}w[v_j]
ans[k]=vi∑w[vi]∗vj!=vi∑w[vj]
=
∑
v
i
w
[
v
i
]
∗
(
∑
v
j
w
[
v
j
]
−
w
[
v
i
]
)
=\sum_{v_i}w[v_i]*(\sum_{v_j}w[v_j]-w[v_i])
=vi∑w[vi]∗(vj∑w[vj]−w[vi])
=
∑
v
i
w
[
v
i
]
∑
v
j
w
[
v
j
]
−
∑
v
i
w
2
[
v
i
]
=\sum_{v_i}w[v_i]\sum_{v_j}w[v_j]-\sum_{v_i}w^2[v_i]
=vi∑w[vi]vj∑w[vj]−vi∑w2[vi]
=
(
∑
v
i
w
[
v
i
]
)
2
−
∑
v
i
w
2
[
v
i
]
=(\sum_{v_i}w[v_i])^2-\sum_{v_i}w^2[v_i]
=(vi∑w[vi])2−vi∑w2[vi]
so,我们只要求出与
k
k
k相邻的点的权值和
s
u
m
sum
sum与权值的平方和
q
s
u
m
qsum
qsum,其所产生的联合权值之和就为
s
u
m
2
−
q
s
u
m
sum^2-qsum
sum2−qsum
nice!
详细代码
#define USEFASTERREAD 1
#define rg register
#define inl inline
#define DEBUG printf("[Passing [%s] in line %d.]\n", __func__, __LINE__)
#define putline putchar('\n')
#define putsp putchar(' ')
#define Rep(a, s, t) for(rg int a = s; a <= t; a++)
#define Repdown(a, t, s) for(rg int a = t; a >= s; a--)
typedef long long ll;
#include<cstdio>
#define rs freopen("test.in", "r", stdin), freopen("test.out", "w", stdout)
#if USEFASTERREAD
char In[1 << 20], *ss = In, *tt = In;
#define getchar() (ss == tt && (tt = (ss = In) + fread(In, 1, 1 << 20, stdin), ss == tt) ? EOF : *ss++)
#endif
struct IO {
void RS() {rs;}
template<typename T> inline IO r(T& x)const {
x = 0; T f = 1; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) if(ch == '-') f = -1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + int(ch - '0');
x *= f; return *this;
}
template<typename T> inline IO w(T x)const {
if(x < 0) {putchar('-'); x = -x;}
if(x >= 10) w(x / 10);
putchar(x % 10 + '0'); return *this;
}
template<typename T> inline IO wl(const T& x)const {w(x), putline; return *this;}
template<typename T> inline IO ws(const T& x)const {w(x), putsp; return *this;}
inline IO l() {putline; return *this;}
inline IO s() {putline; return *this;}
}io;
template<typename T> inline T Max(const T& x, const T& y) {return y < x ? x : y;}
template<typename T> inline T Min(const T& x, const T& y) {return y < x ? y : x;}
template<typename T> inline void Swap(T& x, T& y) {T tmp = x; x = y; y = tmp;}
const int MAXN = 200005;
const int MO = 10007;
int n;
struct Edge {
int v, nxt;
}e[MAXN * 2];
int head[MAXN], cnt;
void addedge(int u, int v) {
e[++cnt].v = v;
e[cnt].nxt = head[u];
head[u] = cnt;
}
ll w[MAXN];
ll anssum;
ll ans;
int main() {
//io.RS();
io.r(n);
for(rg int i = 1; i < n; i++) {
int u, v;
io.r(u).r(v);
addedge(u, v);
addedge(v, u);
}
for(rg int i = 1; i <= n; i++)
io.r(w[i]);
for(rg int i = 1; i <= n; i++) {
ll Mx1 = -1, wMx1 = -1;
for(rg int j = head[i]; j; j = e[j].nxt)//最大值
if(w[e[j].v] > wMx1) Mx1 = e[j].v, wMx1 = w[e[j].v];
ll Mx2 = -1, wMx2 = -1;
for(rg int j = head[i]; j; j = e[j].nxt)//次大值
if(e[j].v != Mx1 && w[e[j].v] > wMx2) Mx2 = e[j].v, wMx2 = w[e[j].v];
if(Mx2 != -1) {//存在次大值
ans = Max(ans, wMx1 * wMx2);
ll sum = 0; ll qsum = 0;
for(rg int j = head[i]; j; j = e[j].nxt)
sum = (sum + w[e[j].v]) % MO, qsum = (qsum + w[e[j].v] * w[e[j].v]) % MO;
anssum = (anssum + sum * sum + MO - qsum) % MO;
}
}
io.ws(ans).wl(anssum);
return 0;
}