Siumai's Blog

一、AVL构造思路1、定义（1）平衡因子：结点的平衡因子为其左子树的高度减去右子树的高度。（2）AVL树：AVL树是所有结点平衡因子绝对值不超过1的BST（二叉查找树）。因此首先定义AVL树的数据结构：typedef struct node{ int data, factor; //factor即平衡因子； struct node *lchild, *rchild;}...

#include <cstdio>typedef struct{ int from, val; }dp;int main(){ int N; scanf("%d", &N); int A[N], max = N - 1; dp DP[N]; for( int i = 0; i < N; ++i ) ...

#include <cstdio>#include <vector>#include <algorithm>#include <queue>using namespace std;#define INF 0x7FFFFFFFtypedef struct{ int w, adj; }Arcnode;vector<vec...

#include <cstdio>#include <algorithm>#include <vector>#include <stack>#define INF 0x7FFFFFFFusing namespace std;typedef struct Arcnode{ int w, adj, E, L; }Arcnode;...

邻接表#include <cstdio>#include <vector>using namespace std;#define INF 0x7FFFFFFFtypedef struct{ int w, adj; }Arcnode;vector<vector<Arcnode>> G;vector<int > P...

#include <cstdio>#include <vector>#include <stack>#include <algorithm>using namespace std;vector<vector<int>> G;vector<int> Indegree, Ans;int Topologic...

#include <cstdio>#include <algorithm>using namespace std;typedef struct{ int a, b, w; } Edgenode;vector<Edgenode> E;vector<int> UFS;int Find( int a ){ while( ...

邻接矩阵#include <cstdio>#include <algorithm>using namespace std;#define INF 0x7FFFFFFFint G[500][500], visited[500], W[500];int Prim( int N ){ int sumW = 0, v; for( int i = 0; ...

#include <cstdio>#include <algorithm>using namespace std;/*堆的关系 前提：根下标为0, 共N个元素；i的左孩子：2i + 1；i的右孩子：2i + 2；i的父亲：（ i - 1 ） / 2；最后一个非叶节点 ( N - 2 ) / 2， 即末尾结点的父亲；*/void AdjustDown( i...

#include <cstdio>int UFS[1000] = {0};void Initiate( int N ){ for( int i = 0; i < N; ++i ) UFS[i] = i;}int Find( int k ){ while( UFS[k] != k ) k = UFS[k]; ret...

#include <cstdio>#include <cstdlib>#include <algorithm>using namespace std;typedef struct AvlNode{ int data, height; struct AvlNode *lchild, *rchild;}AvlNode, *AvlTree;...

注：备战2020ing…暂时没时间注解啦，大家凑合先看下代码叭，肥宅对不住了。#include <cstdio>#include <cstdlib>typedef struct BstNode{ int data; struct BstNode *lchild, *rchild;}BstNode, *Bstree;BstNode *Getpri...