这篇文章是对我的网站的基本介绍，Please read it first!
-
Sticky
-
Hello World
Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub. Qu... -
Chapter 8 - Graph-Shortest Paths
定义 注意 补充、解释 其他 1 Shortest Paths如果图中存在负权环（环上所有边的代价之和为负数），则最短路径不存在 —— 因为可以绕环无限次，让路径长度无限减小。若图中无负权环，定义源点到自身的最短路径长度为 0。 1234567891011121314151617181920void Unweighted(Table T) { int CurrDist; Ve... -
Chapter 3 - Algorithms
1 AlgorithmsAn algorithm is a finite set of precise instructions for performing a computation or for solving a problem. Example: Can we develop a procedure that takes as input a computer program a... -
2026五一假期
春学期真的是很忙啊啊，夏学期估计更忙……所以都没怎么写了，这个五一假期稍微写下，看要做些啥吧 5.2 微积分 学习 微积分 作业 复习大物(补充知识点) 大物历年卷 离散笔记 随便学点 -
Chapter 8 - Advanced Counting Techniques
定义 注意 补充、解释 其他 本章全程高能（ 1 Applications of Recurrence Relations “这种题找递推关系是最难的一步” We distinguish them by the initial conditions, the values of a0 , a1 , a2 , … to uniquely identify a sequence.例如我们... -
Chapter 7 - Graph
定义 注意 补充、解释 其他 1 DefinitionDefinition图(Graph)由顶点集合V和边集合E构成，其中顶点集不能为空，每条边一定要有两个端点想象一个三角形ABC，这个图的顶点集合就是{A,B,C}边集合就是{AB,AC,BC} Undirected Graph: 边AB代表着A可以到B，B也可以到ADirected Graph: 边A->B和边B->A是两条... -
Chapter 3 - Combinational Logic Design
A combinational circuit consists of logic gates whoseoutput is a function of only the present input. Sequential logic is a type of logic circuit whose outputdepends not only on the present value of... -
Chapter 6 - Counting
定义 注意 补充、解释 其他 1 The Basic of Counting1.1 Basic Counting PrinciplesThe Sum RuleIf a first task can be done in ways and a second task in ways, and if these tasks cannot be done at the same time, t...