12 2019 档案

并查集
摘要：Feature To manage the elements grouping, we adopt this kind of special data structure. And it's based on the tree data structure. There are two main o 阅读全文
posted @ 2019-12-09 17:13 IdiotNe 阅读(90) 评论(0) 推荐(0)
优先队列
摘要：Feature Priority queue is based on the ADT heap . And heap has its unique advantange about maintaining the property with its property in $\Theta(\log 阅读全文
posted @ 2019-12-09 17:13 IdiotNe 阅读(89) 评论(0) 推荐(0)
线段树
摘要：Feature Segment tree is derived from the RMQ question, which use segment tree to speed up the updating sparse table process. RMQ Definition: range min 阅读全文
posted @ 2019-12-09 17:12 IdiotNe 阅读(70) 评论(0) 推荐(0)
平衡二叉树(AVL)
摘要：Feature AVL is a kind of highly balanced binary search tree . "Highly balanced" means that every node, its difference between the depth of its left ch 阅读全文
posted @ 2019-12-09 17:12 IdiotNe 阅读(144) 评论(0) 推荐(0)
树状数组
摘要：Feature To deal with dynamic continuous and query problem, and for a given array: $A_1, A_2, \dotsc A_n$, we're asked to support these two operations: 阅读全文
posted @ 2019-12-09 17:12 IdiotNe 阅读(91) 评论(0) 推荐(0)
单源最短路
摘要：Feature There are two different situation: one is that the graph has negative weight edges, the other is not. Always remember that only in the situati 阅读全文
posted @ 2019-12-09 17:10 IdiotNe 阅读(60) 评论(0) 推荐(0)
最小生成树
摘要：Overview There are two different ways to achieve this algorithm. Prim From a single node s , and we can devide the whole graph into two separate parts 阅读全文
posted @ 2019-12-09 17:10 IdiotNe 阅读(77) 评论(0) 推荐(0)
动态规划
摘要：Feature DP is an algorithm that is very flexible. OJ Practise POJ 2392 阅读全文
posted @ 2019-12-09 17:09 IdiotNe 阅读(79) 评论(0) 推荐(0)
DFS&BFS
摘要：Overview These two are two important search algorithm to deal with Graph Theory . In detail, because of the feature of these two algorithm, BFS is oft 阅读全文
posted @ 2019-12-09 17:09 IdiotNe 阅读(75) 评论(0) 推荐(0)
Deep Learning Flower Book 4
摘要：Machine Learning Basics Learning Algorithm "A computer program is said to learn from experience E with respect to some class of tasks T and performanc 阅读全文
posted @ 2019-12-07 14:52 IdiotNe 阅读(169) 评论(0) 推荐(0)
Deep Learning Flower Book 3
摘要：Numerical Computation Overview Because I have no idea about this chapter yet before. So I just try my best to record my view of this chapter. And mayb 阅读全文
posted @ 2019-12-07 14:51 IdiotNe 阅读(152) 评论(0) 推荐(0)
Deep Learning Flower Book 2
摘要：Probability and Information theory Overview We just handle the area that we are unfamiliar with. Uncertainty Inherent stochasticity in the system bein 阅读全文
posted @ 2019-12-07 14:50 IdiotNe 阅读(98) 评论(0) 推荐(0)
Deep Learning Flower Book 1
摘要：原来放在了个人博客中，现在想想把他迁移到博客园，这样个人博客更多的original的知识也好。 Linear Algbera Overview I just make notes about the unfamiliar concept of Linear Algbera. Tensor Somet 阅读全文
posted @ 2019-12-07 14:48 IdiotNe 阅读(189) 评论(0) 推荐(0)
IOI论文阅读笔记--动态规划
摘要：文章是阅读IOI集训队神犇们论文的笔记，本来也是想着锻炼英文，后来就干脆简短记录重点放在这里。 阅读全文
posted @ 2019-12-01 22:36 IdiotNe 阅读(256) 评论(0) 推荐(0)