洛谷 P4913【深基16.例3】二叉树深度

题目传送门： 【深基16.例3】二叉树深度 

 

/*
Takes:luogu
Title:P4913
Time:2025/1/15
*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define endl '\n'
// #pragma GCC optimize(2)

#define pii pair<int, int>
#define pdd pair<double, double>
#define psi pair<string, int>
#define be(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)(x).size())

pii A[1000001];

int dfs(int c)
{
    if (A[c].first == 0 && A[c].second == 0)
        return 0;
    return max(dfs(A[c].first), dfs(A[c].second)) + 1;
}

void solve()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> A[i].first >> A[i].second;
    cout << dfs(1) + 1 << endl;
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}