FZU 2082 过路费
题目链接
树链抛分修改边的模板题
代码:
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 50005;
int dep[N], id[N], sz[N], top[N], son[N], fa[N], idx;
int n, m;
ll bit[N];
struct Edge {
int u, v;
ll val;
void read() {
scanf("%d%d%lld", &u, &v, &val);
}
} e[N];
vector<int> g[N];
inline int lowbit(int x) {
return x&(-x);
}
void dfs1(int u, int f, int d) {
d......
阅读全文