原题传送门
结论:答案一定是某个点,或者一段1,或者一段1中间有个2
某个点的情况不论,如果能有答案比单个点更优,一定满足上面的结论
证明:
1.11111
(
x
个
)
311111
(
y
个
)
1.11111(x个)311111(y个)
1.11111(x个)311111(y个),总的值是
3
x
+
y
+
1
\frac{3}{x+y+1}
x+y+13,令
x
<
=
y
x<=y
x<=y,则还有一种情况是
1
y
\frac{1}{y}
y1
3
x
+
y
+
1
<
1
y
,
3
y
<
x
+
y
+
1
,
2
y
<
x
+
1
\frac{3}{x+y+1}<\frac{1}{y},3y<x+y+1,2y<x+1
x+y+13<y1,3y<x+y+1,2y<x+1不可能,所以一段1中间不可能有
>
=
3
>=3
>=3的数,或者乘积会
>
=
3
>=3
>=3
2.11111 ( x 个 ) 3 , 3 x + 1 < 1 x , 3 x < x + 1 , 2 x < 1 2.11111(x个)3,\frac{3}{x+1}<\frac{1}{x},3x<x+1,2x<1 2.11111(x个)3,x+13<x1,3x<x+1,2x<1,不可能,所以一段1的端点不可能接上一个 > = 3 >=3 >=3的数
3.11111
(
x
个
)
2
,
2
x
+
1
<
1
x
,
2
x
<
x
+
1
,
x
<
1
3.11111(x个)2,\frac{2}{x+1}<\frac{1}{x},2x<x+1,x<1
3.11111(x个)2,x+12<x1,2x<x+1,x<1,不可能,所以一段1的端点不可能接上一个
>
=
2
>=2
>=2的数
所以,正确答案两端不能>1
4.11111
(
x
个
)
211111
(
y
个
)
,
x
<
=
y
4.11111(x个)211111(y个),x<=y
4.11111(x个)211111(y个),x<=y
2
x
+
y
+
1
<
1
y
,
2
y
<
x
+
y
+
1
,
y
<
x
+
1
,
y
<
=
x
\frac{2}{x+y+1}<\frac{1}{y},2y<x+y+1,y<x+1,y<=x
x+y+12<y1,2y<x+y+1,y<x+1,y<=x
又
y
>
=
x
,
所
以
y
=
x
又y>=x,所以y=x
又y>=x,所以y=x
当且仅当
x
=
y
x=y
x=y时,可以使中间插上一个2,更优
能不能多插几个2?结论1告诉我们了,不行
其实呢,我们只需要用到正确答案是一段1中间可能有一个2就行了
用树形dp解决
d
p
u
,
1
dp_{u,1}
dpu,1表示全是1的最长链
d
p
u
,
2
dp_{u,2}
dpu,2表示包含一个2的最长链
- a u = 1 : d p u , 1 = m a x ( d p u , 1 , d p v , 1 + 1 ) , d p u , 2 = m a x ( d p u , 2 , d p v , 2 + 1 ) a_u=1:dp_{u,1}=max(dp_{u,1},dp_{v,1}+1),dp_{u,2}=max(dp_{u,2},dp_{v,2}+1) au=1:dpu,1=max(dpu,1,dpv,1+1),dpu,2=max(dpu,2,dpv,2+1)
- a u = 2 : d p u , 2 = m a x ( d p u , 2 , d p v , 1 + 1 ) a_u=2:dp_{u,2}=max(dp_{u,2},dp_{v,1}+1) au=2:dpu,2=max(dpu,2,dpv,1+1)
然后每个点的时候都求一个答案
需要记录下儿子中最长,次长的1链,2链
注意的一点是如果最长的1链,2链是同一条,不能同取
Code:
#include <bits/stdc++.h>
#define maxn 1000010
#define LL long long
using namespace std;
struct Edge{
int to, next;
}edge[maxn << 1];
int num, head[maxn], n;
LL a[maxn], dp[maxn][3], p, q;
inline int read(){
int s = 0, w = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
return s * w;
}
void addedge(int x, int y){ edge[++num] = (Edge){y, head[x]}, head[x] = num; }
LL gcd(LL m, LL n){ return n == 0 ? m : gcd(n, m % n); }
void update(LL x, LL y){ if (x * q < y * p) p = x, q = y; }
void dfs(int u, int pre){
if (a[u] == 1) dp[u][1] = 1;
if (a[u] == 2) dp[u][2] = 1;
int fir = 0, sec = 0, fir2 = 0, sec2 = 0;
for (int i = head[u]; i; i = edge[i].next){
int v = edge[i].to;
if (v == pre) continue;
dfs(v, u);
}
for (int i = head[u]; i; i = edge[i].next){
int v = edge[i].to;
if (v == pre) continue;
if (a[u] == 1) dp[u][1] = max(dp[u][1], dp[v][1] + 1), dp[u][2] = max(dp[u][2], dp[v][2] + 1);
if (a[u] == 2) dp[u][2] = max(dp[u][2], dp[v][1] + 1);
if (dp[v][1] > dp[fir][1]) sec = fir, fir = v;
else if (dp[v][1] > dp[sec][1]) sec = v;
if (dp[v][2] > dp[fir2][2]) sec2 = fir2, fir2 = v;
else if (dp[v][2] > dp[sec2][2]) sec2 = v;
}
if (a[u] == 1){
update(1, dp[fir][1] + dp[sec][1] + 1);
if (fir == fir2) update(2, dp[sec][1] + dp[fir2][2] + 1), update(2, dp[fir][1] + dp[sec2][2] + 1);
else update(2, dp[fir][1] + dp[fir2][2] + 1);
}
if (a[u] == 2) update(2, dp[fir][1] + dp[sec][1] + 1);
}
int main(){
n = read();
for (int i = 1; i < n; ++i){
int x = read(), y = read();
addedge(x, y), addedge(y, x);
}
p = 1e9, q = 1;
for (int i = 1; i <= n; ++i) p = min(p, a[i] = read());
dfs(1, 0);
LL r = gcd(p, q);
printf("%lld/%lld\n", p / r, q / r);
return 0;
}