随笔分类 -  pat甲级

1151 LCA in a Binary Tree (30 分)
摘要：两种解法 【解法一】 树上倍增求LCA #include <bits/stdc++.h> #define ll long long using namespace std; const ll maxn = 1000005; typedef struct node { ll val; node *l, 阅读全文
posted @ 2021-09-01 20:02 DurKui 阅读(63) 评论(0) 推荐(0)