dfs综合
GreyBtfly王宝彤
业精于勤,荒于嬉;行成于思,毁于随
展开
-
(银牌题)ACM-ICPC 2018 沈阳赛区网络预赛 J - Ka Chang dfs时间戳+树状数组+二分+分块
博客目录 原题 题目传送门 18.55% 1000ms 131072K Given a rooted tree ( the root is node 11 ) of NN nodes. Initially, each node has zero point. Then, you need to handle QQ operations. There're two types...原创 2018-09-29 12:54:44 · 907 阅读 · 0 评论 -
2017ACM/ICPC沈阳 L - Tree HDU - 6228 DFS思维题
博客目录 原题 题目传送门 Consider a un-rooted tree T which is not the biological significance of tree or plant, but a tree as an undirected graph in graph theory with n nodes, labelled from 1 to n. If you can...原创 2018-10-08 18:46:25 · 336 阅读 · 0 评论