Description: Among them, a is the inlet, B is the outlet, and S is the transfer blind end. All railways are monorail unidirectional: the train can only travel from a to s, and then from s to B; it can also run directly from a to B without staying in S; in addition, due to the narrow size of S, cars can not turn around or overtake in s, which means that any car staying in s can move out of s if and only if all the cars that enter s after it have moved out of S (or No cars enter s after it. Because the cars can stay in s, the order in which they leave from end B may be different from that in which they enter from end a. However, the capacity of S is limited and no more than m cars can stay at the same time.

Plat: Visual C++ | Size: 2KB | Downloads: 0

Description: Generally speaking, given the sequence of preorder traversal and postorder traversal of a binary tree, it is not sure that the binary tree can be uniquely determined.

Plat: Visual C++ | Size: 2058KB | Downloads: 0

Description: There are n students in an English class. Each student has his own integer student number. Note that this time due to the expansion of the course, the number of students is very large.
Now this English course is ready for the final examination. The form of the examination is: each student has a conversation with the teacher for a period of time. The teacher decided to make use of the round table outside the classroom and determine the examination order randomly according to the following method: the first arriving student will sit down at any position around the round table; after that, each student who arrives will start from the former student and walk around the round table in a counter clockwise direction (the former student is counted as the first person who

Plat: Visual C++ | Size: 2KB | Downloads: 0

Description: Coaches a, B and C will choose their own players from the players numbered 1 to n. To be fair, each coach ranks the players according to their preference; you are responsible for assigning them players according to the following rules.
The data you get is a, B, C three arrays, which show the three coaches' preference for the team members. Each array is an array of numbers from 1 to N. the smaller the subscript, the more the coach likes the team member (for example, coach a likes the player numbered a [0], followed by the player numbered a [1]). Your grouping rule is to find a coach a's favorite player from the unassigned players and assign it to group A; then, from the unallocated players, coach B's favorite player is assigned to group B; then coach C; then coaches a, B, and so on until all players are allocated.
Now player K wants to know which coach he is assigned to. Please tell him.

Plat: Visual C++ | Size: 1KB | Downloads: 0

Description: Among them, a is the inlet, B is the outlet, and S is the transfer blind end. All railways are monorail unidirectional: the train can only travel from a to s, and then from s to B; it can also run directly from a to B without staying in S; in addition, due to the narrow size of S, cars can not turn around or overtake in s, which means that any car staying in s can move out of s if and only if all the cars that enter s after it have moved out of S (or No cars enter s after it. Because the cars can stay in s, the order in which they leave from end B may be different from that in which they enter from end a. However, the capacity of S is limited and no more than m cars can stay at the same time.
Suppose that a train is composed of N cars numbered {A1, A2,..., an}. The dispatcher would like to know whether, according to the above traffic rules, these cars can be rearranged in the order of {1,2,..., n} and then drive out from end B.

Plat: Visual C++ | Size: 1KB | Downloads: 0

Description: Heap Data structure PPT

Plat: C/C++ | Size: 175KB | Downloads: 0

Description: On the algorithm of binary tree

Plat: C/C++ | Size: 2KB | Downloads: 0

Description: This book is rich in examples, illustrated and illustrated. It explains the algorithm in a concise and easy to understand way. It aims to help programmers make better use of algorithms to help software development in daily projects. The first three chapters introduce the basic algorithm, including binary search, big O representation, two basic data structures and recursion. The remaining space will mainly introduce the widely used algorithms, including: when facing specific problems, how to use greedy algorithm or dynamic programming; hash table application; graph algorithm; k-nearest neighbor algorithm.
This book is suitable for all programmers, computer related teachers and students as well as interested in algorithm readers.

Plat: Python | Size: 16281KB | Downloads: 0

Description: r e s f s fsd f sddi ad a udioa jdljasld lk dklaj dm s

Plat: PHP | Size: 208KB | Downloads: 0

Description: It realizes the selective sorting and has the calculation of time complexity, which is convenient to compare with other sorting algorithms.

Plat: Java | Size: 3KB | Downloads: 0

Description: Can realize the library management system

Plat: C/C++ | Size: 13719KB | Downloads: 0

Description: The post office location problem based on divide and conquer algorithm is simple and easy to understand and consolidate learning

Plat: C/C++ | Size: 290KB | Downloads: 0

Description: The post office location problem based on C language can be directly used to learn and use

Plat: C/C++ | Size: 187KB | Downloads: 0

Description: Huffman coding, download can learn to use, understand coding decoding is very useful

Plat: C/C++ | Size: 236KB | Downloads: 0

Description: Dijkstra algorithm is a typical shortest path algorithm, which is used to calculate the shortest path from one node to other nodes.
Its main feature is to expand to the center of the idea

Plat: C/C++ | Size: 1KB | Downloads: 0

Description: Huffman coding compressed file, used to achieve Huffman tree programming.

Plat: Java | Size: 236KB | Downloads: 0

Description: This algorithm uses Java language to realize the post office location problem, and gives the source code.

Plat: Java | Size: 239KB | Downloads: 0

Description: Data structure C language,data structure algorithm, realize bubble sort unction, quick sort and other functions

Plat: C/C++ | Size: 11KB | Downloads: 0

Description: Data structure C language,data structure algorithm, realize bubble sort unction, quick sort and other functions

Plat: C/C++ | Size: 11KB | Downloads: 0

Description: Data structure C language,data structure algorithm, realize bubble sort unction, quick sort and other functions

Plat: C/C++ | Size: 79KB | Downloads: 0

Plat: C/C++ | Size: 230KB | Downloads: 0

Description: Data structure and algorithm

Plat: C/C++ | Size: 15849KB | Downloads: 0

Description: The most simple basic application of stack written in C language, using the basic operation of stack to complete the conversion between decimal and binary system.

Plat: C/C++ | Size: 10KB | Downloads: 0

Description: The operation of List

Plat: C/C++ | Size: 11KB | Downloads: 0

Description: Combat Arms Client FxPDB

Plat: Visual C++ | Size: 841KB | Downloads: 0

Description: Give the n-n board to find a solution to the n-queen

Plat: C/C++ | Size: 1KB | Downloads: 0

Description: C / C + + description of algorithm data structure book, Chinese version

Plat: C/C++ | Size: 22321KB | Downloads: 0

Description: Explain the data structure and analyze the algorithm by C + + language

Plat: C/C++ | Size: 23777KB | Downloads: 0

Description: The d algorithm calculates the shortest path

Plat: Java | Size: 3KB | Downloads: 0

Description: Declare a one-dimensional array, represent the sequential stack, indicate the capacity of the sequential stack, initialize the stack, and construct a one-dimensional generic array with the size determined by the parameters

Plat: Java | Size: 4KB | Downloads: 0