Programmer Think

1, Basic knowledge understanding (I have some colloquial explanations + Baidu subject explanations. Please consult the literature for professional explanations. I compiled the introduction graph theory of Discrete Mathematics (Fifth Edition) through Qu Wanling, Geng Suyun and Zhang Linang. This book is a rare good book for introductory compute ...

Long chain subdivision On the whole, it is very similar to heavy chain dissection First, define the heavy son as: the son with the deepest subtree depth Then the rest is the light son The heavy side is connected to the heavy son, and the heavy side is connected into a heavy chain Each point is in a unique long chain, and the long chain must not ...

I was brushing the water question, but I suddenly found this question. It happened to be what we learned yesterday, so we came to consolidate it. Give it to us n n n points, m m m edge ...

Problem surface Well known gourmet Xiao A was invited to ATM hotel to taste the dishes. ATM hotel has prepared \ (n \) dishes for Xiao A. the hotel numbers the dishes in the order of \ (1 \) to \ (n \) according to the estimated quality from high to low, and the estimated number of dishes with the highest quality is \ (1 \). Due to the problem ...

Dynamic point divide and conquer, with repair. Obviously, if the simple use of point divide and conquer will timeout, then we just need to consider inheritance, and there seems to be nothing else. Analyzing the whole process, we need to re count the overall situation if we only change one point. Obviously, it's not good. Then the modified point ...

On round square tree Point biconnected component definition If an undirected graph does not change its connectivity by removing any node, that is, there is no cut point, it is called a point biconnected graph. Every maximal vertex biconnected subgraph in an undirected graph is called the vertex biconnected component of the undirected graph. Unl ...

Traveling salesman deformation 2 Traveling salesman deformation 2 (Avionics OJ hangs up) Time limit: 3 seconds Space limit: 256M Title Description Sanli akaman Decided to visit n n n cities. It wants to visit all cities. It doesn't mind which city is he ...

kruskal algorithm (kruskal algorithm) detailed explanation There are two common methods to find the minimum spanning tree in connected networks, which are called prim algorithm and Kruskal algorithm. In this section, we will explain the Kruskal algorithm to you. The method of Kruskal algorithm to find the minimum spanning tree is to sort all ...

Title Description David the great has just become king of a desert country. In order to win the respect of the people, he decided to build channels all over the country to supply water to each village. The villages connected to his capital village will be watered. As the master of the country and the symbol of wisdom, he needs to build the cha ...

Title: This question requires you to realize an exclusive online map of the ladder race. After the team members enter their school location and venue location, the map should recommend two routes: one is the fastest route to reach; One is the shortest route. The topic ensures that there is at least one reachable route on the map for any query ...