(Optional) DP on Trees - Solving For All Roots

C++

1#include <bits/stdc++.h>
2using namespace std;
3
4vector<int> graph[200001];
5pair<int, int> best[200001];
6int sec[200001], ans[200001];
7
8void dfs1(int node = 1, int parent = 0) {
9    for (int i : graph[node]) if (i != parent) {
10        dfs1(i, node);

Java

1import java.util.*;
2import java.io.*;
3
4public class Main {
5    public static ArrayList <Integer> g[];
6    public static Pair maxl1[];
7    public static Pair maxl2[];
8    public static void main(String[] args) throws Exception {
9        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
10        int N = Integer.parseInt(br.readLine());