Coldfresh的博客

keeeeeep!~

Minimum spanning tree for each edge CodeForces - 609E(ST算法+树链剖分(或倍增LCA)+最小生成树)

Connected undirected weighted graph without self-loops and multiple edges is given. Graph contains n vertices and m edges. For each edge (u, v) find...

2018-03-21 13:49:34

阅读数:82

评论数:0

Aragorn's Story HDU - 3966(树链剖分)

Our protagonist is the handsome human prince Aragorn comes from The Lord of the Rings. One day Aragorn finds a lot of enemies who want to invade his ...

2017-10-09 23:25:25

阅读数:94

评论数:0

Query on a tree SPOJ - QTREE(树链剖分)

传送门 题意:给定一棵树,告诉了每条边的权值,然后给出两种操作: (1)把第i条边的权值改为val (2)询问a,b路径上权值最大的边 假期之后的第一篇题解,只学习了一种新的数据结构,树链剖分,此题为入门题,这个我算是学习的最晚的一个人了。这个有种调用了线段的API的感觉#include&...

2017-10-09 15:48:12

阅读数:113

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭