CSES - Finding a Centroid

C++

#include <bits/stdc++.h>
using namespace std;

const int maxn = 2e5+5;
int n; // number of nodes
vector<int> g[maxn]; // graph
int s[maxn]; // size of subtree

void dfs_size(int cur, int par) {
	s[cur] = 1;