/
1292C.go
72 lines (66 loc) · 1.15 KB
/
1292C.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
package main
import (
"bufio"
. "fmt"
"io"
)
// github.com/EndlessCheng/codeforces-go
func CF1292C(_r io.Reader, out io.Writer) {
in := bufio.NewReader(_r)
max := func(a, b int64) int64 {
if b > a {
return b
}
return a
}
var n, v, w int
Fscan(in, &n)
g := make([][]int, n)
for i := 1; i < n; i++ {
Fscan(in, &v, &w)
v--
w--
g[v] = append(g[v], w)
g[w] = append(g[w], v)
}
pa := make([][]int, n)
sz := make([][]int, n)
for i := range pa {
pa[i] = make([]int, n)
sz[i] = make([]int, n)
var f func(int, int)
f = func(v, fa int) {
pa[i][v] = fa
sz[i][v] = 1
for _, w := range g[v] {
if w != fa {
f(w, v)
sz[i][v] += sz[i][w]
}
}
}
f(i, -1)
}
dp := make([][]int64, n)
for i := range dp {
dp[i] = make([]int64, n)
}
var f func(int, int) int64
f = func(v, w int) int64 {
if v == w {
return 0
}
if dp[v][w] == 0 {
dp[v][w] = max(f(pa[w][v], w), f(v, pa[v][w])) + int64(sz[v][w]*sz[w][v])
}
return dp[v][w]
}
ans := int64(0)
for v := 0; v < n; v++ {
for w := v + 1; w < n; w++ {
ans = max(ans, f(v, w))
}
}
Fprint(out, ans)
}
//func main() { CF1292C(os.Stdin, os.Stdout) }