LCA
Mitsuha_
Rush to the dead summer
展开
-
Codeforces-1062E:Company(LCA+线段树)
E. Company time limit per test 2 seconds memory limit per test 256 megabytes inputstandard input outputstandard output The company X has n employees numbered from 1 through n. Each employee u has a di...原创 2018-11-17 20:28:37 · 850 阅读 · 0 评论 -
ACM-ICPC 2018 徐州赛区网络预赛-J:Maze Designer(最大生成树+LCA)
After the long vacation, the maze designer master has to do his job. A tour company gives him a map which is a rectangle. The map consists of N×MN×MN×M little squares. That is to say, the height of th...原创 2018-09-10 13:57:17 · 323 阅读 · 0 评论 -
Codeforces-GYM(101808):Another Shortest Path Problem(思维+LCA)
K. Another Shortest Path Problemtime limit per test3.0 smemory limit per test256 MBinputstandard inputoutputstandard outputShortest path problems have always been a part of competitive programming, ap...原创 2018-06-09 00:22:10 · 824 阅读 · 0 评论 -
Codeforces-191C: Fools and Roads(LCA)
Codeforces-191C: Fools and Roads(LCA)They say that Berland has exactly two problems, fools and roads. Besides, Berland has n cities, populated by the fools and connected by the roads. All Berland roads are bidirectional. As there are many fools in Berland,原创 2017-11-16 22:42:16 · 847 阅读 · 0 评论 -
hihocoder#1069 : 最近公共祖先·三(DFS序列+线段树)
hihocoder#1069 : 最近公共祖先·三(DFS序列+线段树)上上回说到,小Hi和小Ho使用了Tarjan算法来优化了他们的“最近公共祖先”网站,但是很快这样一个离线算法就出现了问题:如果只有一个人提出了询问,那么小Hi和小Ho很难决定到底是针对这个询问就直接进行计算还是等待一定数量的询问一起计算。毕竟无论是一个询问还是很多个询问,使用离线算法都是只需要做一次深度优先搜索就可以了的。 那么问题就来了,如果每次计算都只针对一个询问进行的话,那么这样的算法事实上还不如使用最开始的朴素算法呢!但是如果原创 2017-10-10 21:58:15 · 471 阅读 · 0 评论