HDU Aragorn's Story
题目链接
树抛入门裸题,这题是区间修改单点查询,于是套树状数组就OK了
代码:
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 50005;
inline int lowbit(int x) {return x&(-x);}
int dep[N], fa[N], son[N], sz[N], top[N], id[N], idx;
vector<int> g[N];
int bit[N];
int n, m, p, val[N];
void dfs1(int u, int f, int d) {
dep[u] = d;
sz[u] = 1;
fa[u] = f;
son[u] = 0;
for ......
阅读全文