利用lca求最短路径
三种情况:
- a是b祖先
- b是a祖先
- a和b有公共祖先c
Tip: 权值不为1,就树形dp
小A的最短路
/*
* Author: Chen_zhuozhuo
* Created Time: 2020/8/9 14:39:32
* File Name: b.cpp
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <time.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define debug(x) cout << #x << ": " << x << endl
#define debug_(x, y) cout << #x << ": " << x <<" "<< #y << ": " << y << endl
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int maxint = -1u>>1;
const int inf = 0x3f3f3f3f;
const int maxn = 3e5 + 10;
int n, m;
int depth[maxn];
int cnt = 1;
int ans;
int from, to;
int head[maxn];
int fa[maxn][21];
int a, b;
vector<int> V;
struct EDGE {
int to, next;
} edge[maxn << 1];
void init() {
for(int i=1; i<=n