2023年11月14日
D. Score of a Tree
摘要： D. Score of a Tree You are given a tree of $n$ nodes, rooted at $1$. Every node has a value of either $0$ or $1$ at time $t=0$. At any integer time $t 阅读全文
posted @ 2023-11-14 16:35 onlyblues 阅读(31) 评论(0) 推荐(0)
Web Analytics