1.最大生成树去除重边,只要最大的边成树
2.LCA查最近公共祖先,然后询问的lca(x,y)ff,分别从x,y向上找最小边
3.bfs1/dfs1就是2.中向上找的具体实现 #include<bits/stdc.h>
using namespace std;
#define N 100011
typedef long long ll;
typede…
rkmpp 解码流程(除 MPP_VIDEO_CodingMJPEG 之外) 源码
输入h264码流 输出nv12文件
/** Copyright 2015 Rockchip Electronics Co. LTD** Licensed under the Apache License, Version 2.0 (the "License");* you may not use this file exce…