Vmorish

—— Anything is possible

排序:
默认
按更新时间
按访问量

HYSBZ - 2243 [SDOI2011]染色(树链剖分)

HYSBZ - 2243 [SDOI2011]染色(树链剖分) Description 给定一棵有n个节点的无根树和m个操作,操作有2类: 1、将节点a到节点b路径上所有点都染成颜色c; 2、询问节点a到节点b路径上的颜色段数量(连续相同颜色被认为是同一段),如“112221”由3段组成:“11...

2017-09-03 09:11:31

阅读数:141

评论数:0

HYSBZ - 1036 树的统计Count(树链剖分)

HYSBZ - 1036 树的统计Count(树链剖分) Description   一棵树上有n个节点,编号分别为1到n,每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成 一些操作: I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点...

2017-08-29 09:19:50

阅读数:157

评论数:0

POJ - 3237 Tree(树链剖分)

POJ - 3237 Tree(树链剖分) Description You are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 through ...

2017-08-28 19:27:11

阅读数:149

评论数:0

FZU - 2082 过路费(树链剖分)

FZU - 2082 过路费(树链剖分) Problem Description 有n座城市,由n-1条路相连通,使得任意两座城市之间可达。每条路有过路费,要交过路费才能通过。每条路的过路费经常会更新,现问你,当前情况下,从城市a到城市b最少要花多少过路费。 Input 有多组样例,每组样...

2017-08-28 10:19:55

阅读数:94

评论数:0

POJ - 2763 Housewife Wind(树链剖分)

POJ - 2763 Housewife Wind(树链剖分) Description After their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. P...

2017-08-24 10:09:37

阅读数:103

评论数:0

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

HDU - 3966 Aragorn's Story(树链剖分) Problem Description Our protagonist is the handsome human prince Aragorn comes from The Lord of the Rings. One day A...

2017-08-23 15:35:16

阅读数:91

评论数:0

HDU - 6162 Ch’s gift(树链剖分)

HDU - 6162 Ch’s gift(树链剖分) Problem Description Mr. Cui is working off-campus and he misses his girl friend very much. After a whole night tossing and...

2017-08-23 10:03:35

阅读数:200

评论数:0

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

SPOJ - QTREE Query on a tree You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We will as...

2017-08-20 20:37:54

阅读数:129

评论数:0

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