WZJRJ28

题意：给你一棵树，每次一个操作，修改书上最多不超过1000个点的值，然后询问u到v路径上的权值和。 分析：树链剖分，后边单点修改区间查询可以用树状数组。 #include #include #include #include #include #include #include #include #define INF 0x3f3f3f3f #define MOD 100000

Description You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We will ask you to perfrom some instructions of the following form:

Problem Description A boy named List who is perfect in English. Now he wants to travel and he is making a plan. But the cost of living in same citie always changes. Now he wants to know how many diff