Pudding Monster but on a tree :))

Правка en1, от Sammmmmmm, 2024-08-06 12:13:19

Given a tree of n vertices, count the number of ways to choose a connected subgraph of the tree so that all the vertices in that

subgraph consists of consecutive integers when sorted. Thanks!

N <= 3e5

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Sammmmmmm 2024-08-06 12:13:19 240 Initial revision (published)