【题解】CF191C：Fools and Roads

原题传送门
我记得有一道题目叫做“最大流”（可不是网络流）
那道题目是询问每个点经过了几次
这道题目是每条边经过了几次
同样是裸的树上差分
但是边和点的差分是不一样的
边是++power[u],++power[v],power[lca]-=2
点是++power[u],++power[v],--power[lca],--power[fa[lca]]
这道题还要一个以点代边的操作
是不是特别水啊

Code：

#include <bits/stdc++.h>
#define maxn 100010
using namespace std;
struct Edge{
	int to, next;
}edge[maxn << 1];
struct Line{
	int x, y;
}line[maxn];
int num, head[maxn], d[maxn], fa[maxn][25], power[maxn], n, m, ans[maxn], id[maxn];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
} 

void addedge(int x, int y){ edge[++num] = (Edge){ y, head[x] }; head[x] = num; }

void dfs(int u, int pre){
	d[u] = d[pre] + 1, fa[u][0] = pre;
	for (int i = 0; fa[u][i]; ++i) fa[u][i + 1] = fa[fa[u][i]][i];
	for (int i = head[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if (v != pre) dfs(v, u);
	}
}

int Lca(int u, int v){
	if (d[u] > d[v]) swap(u, v);
	for (int i = 20; i >= 0; --i) if (d[u] <= d[v] - (1 << i)) v = fa[v][i];
	if (u == v) return u;
	for (int i = 20; i >= 0; --i) if (fa[u][i] != fa[v][i]) u = fa[u][i], v = fa[v][i];
	return fa[u][0];
}

void dfs(int u){
	for (int i = head[u]; i; i = edge[i].next){
		int v = edge[i].to;
		if (v != fa[u][0]) dfs(v), power[u] += power[v];
	}
	ans[id[u]] = power[u];
}

int main(){
	n = read();
	for (int i = 1; i < n; ++i){
		line[i].x = read(), line[i].y = read();
		addedge(line[i].x, line[i].y); addedge(line[i].y, line[i].x);
	}
	dfs(1, 0);
	for (int i = 1; i < n; ++i)
		if (d[line[i].x] > d[line[i].y]) id[line[i].x] = i; else id[line[i].y] = i;
	m = read();
	while (m--){
		int x = read(), y = read(), lca = Lca(x, y);
		++power[x], ++power[y], power[lca] -= 2;
	}
	dfs(1);
	for (int i = 1; i < n; ++i) printf("%d ", ans[i]);
	return 0;
}