乱搞不行，直接编译失败了
by Weizhuo_Zhao @ 2023-07-06 08:33:55
不是，我这里为啥编译失败？
```cpp
#include<cstdio>
#include<queue>
#include<map>
#include<cstring>
#include<cstdlib>
#include<deque>
#include<iostream>
#include<vector>
#include<algorithm>
#define inf 0x3f3f3f3f
#define M 1000010
using namespace std;
int cnt , head[M] , next[M << 1] , u[M << 1] , n , ans, size[M];
long long d[M] , f[M] , maxn ;
void add(int x , int y){
u[++cnt] = y , next[cnt] = head[x] , head[x] = cnt;
}
inline void dfs1(int x , int fa , int dep){
int y ;
for (int i = head[x] ; i ; i = next[i]){
y = u[i];
if ( y == fa) continue;
dfs1(y , x , dep + 1); size[x] += size[y] , d[x] += d[y];
} size[x] += 1 , d[x] += dep;
}
inline void dfs2(int x , int fa){
int y;
for (int i = head[x] ; i ; i = next[i]){
y = u[i];
if (y == fa) continue;
f[y] = f[x] + n - size[y] * 2;
dfs2(y , x);
}
}
int main(){
// freopen("A.out" , "w" , stdout);
// freopen("c1.in" , "r" , stdin);
scanf("%d" , &n);
for (int i = 1 ; i < n ; ++i){
int a , b; scanf("%d%d" , &a , &b);
add(a , b); add(b , a);
}
dfs1(1 , 0 , 0); f[1] = d[1];
dfs2(1 , 0 );
for (int i = 1 ; i <= n ; ++i) if (f[i] > maxn) ans = i , maxn = f[i];
printf ("%d" , ans);
return 0;
}
```
by Weizhuo_Zhao @ 2023-07-06 08:36:21
@[Weizhuo_Zhao](/user/681558) `next` 是关键字不能用。
by FFTotoro @ 2023-07-06 08:44:06
`size` 也是关键字
by FFTotoro @ 2023-07-06 08:44:47
@[zyc212303](/user/556366) OK,Tank you
by Weizhuo_Zhao @ 2023-07-06 08:46:42
@[zyc212303](/user/556366) 给忘了
by Weizhuo_Zhao @ 2023-07-06 08:47:15
@[Weizhuo_Zhao](/user/681558) "tank" you
您是不是要开坦克来轰我（害怕
by FFTotoro @ 2023-07-06 08:48:33
@[zyc212303](/user/556366) Oh掉了h
Thank you
by Weizhuo_Zhao @ 2023-07-06 08:53:17