qq_44866969的博客

#include<bits/stdc++.h>using namespace std;const int N=3e5+100;int color[N];vector<int> v[N];int b[N][110];int start[N],ed[N];int cnt;int n,q;void dfs(int x){ start[x]=++cnt; for(int i=0;i<v[x].size();i++){ dfs(v[x][i]); } ed.

int n;int a[1005]; //原数组int c[1005]; //树状数组int lowbit(int x){ return x&(-x);}void updata(int i,int k){ //在i位置加上k while(i <= n){ c[i] += k; i += lowbit(i); }}int getsum(int i){ //求a[1~i]的和 int ans =.