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

阅读数:83

评论数:0

GCD HDU - 5726 (ST算法+二分)

Give you a sequence of N(N≤100,000)integers : a1,…,an(0#include<cstdio> #include<iostream> #include<queue> #include<cstring> ...

2017-09-19 00:54:37

阅读数:249

评论数:0

Connections between cities HDU - 2874(LCA)(RMQ)(dfs)(st算法)

After World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. However, some materials needed can only be produ...

2017-09-15 16:38:59

阅读数:105

评论数:0

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