Others

Question link: http://acm.fzu.edu.cn/problem.php? PID = 1, 1924 One solution is to construct a tree by using a vertex query set. If a tree is formed instead of a vertex and a loop is formed, a deadlock exists. QuestionCode: # Include # include

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1532   Question: It is because John's farm will be drowned by the rain, but John had to build a water ditch, and it was a network water ditch, and the clever John also controlled

Hdu1385: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1385 This question is to let you find the minimum cost. What is more difficult is that it is not only the Shortest Path of the edge weight value, but also the Shortest Path of the Edge Weight

Ask the shortest distance between each tree and other trees, and record that the distance is only 0-9. Idea: brute force attack... Search directly, but remember that the final distance is rounded down rather than rounded up. At first, I understood

Find the string with the most key characters in the string. If the key characters are the same, all the equal key characters must be output. Train of Thought: Find the key characters one by one, open a vis array, record the number of key characters

Question Link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1532   Question: It is because John's farm will be drowned by the rain, but John had to build a water ditch, and it was a network water ditch, and the clever John also controlled

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2546   Solution: to minimize the balance on the card after a meal purchase, but the restriction is that the balance on the card must be no less than 5 yuan to buy meals, in this case,

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1599   That is to say, 8600 will go on a trip and give you several scenic spots. 8600 wants to find a route, for example, starting from a and returning to, in addition to the

Link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1203    ====================================== The most important thing is that the dynamic equation is: DP [I] = max (DP [I], 1-(1-dp [I-money]) * (1-rp )); The probability algorithm is: 1-(1-0.2

The main idea is: The following describes how to sort the topology of an AOV network: 1: select a vertex with an inbound degree of 0 (no direct precursor) from the AOV network and Output 2: delete the vertex from the AOV network and all edges from

Binary Tree similarity means that either they are empty or both have only one root node, or their left and right trees are similar. Reference code: #includeusing namespace std;struct Binode{char data;Binode* lchild;Binode* rchild;};class

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1059 That is to say, two people have collected some beautiful marble, and now they want to divide them, And they want everyone to get the same marble value. Now there are 1-to-6 marble

There are two piles of stones, which can be different in quantity. The game started with taking stones in turn by two people. The game stipulates that there are two different methods to get each time. One is to remove any number of stones from any

Let's explain the examples we have seen! Suppose a sequence d [1 .. 9] = 2 1 5 3 6 4 8 9 7, it can be seen that its LIS length is 5. next we will find its LIS step by step. We define a sequence as B, and then use I to examine it from 1 to 9. Define

Problem descriptiona ring is compose of N circles as shown in digoal. put Natural Number 1, 2 ,..., N into each circle separately, and the sum of numbers in two adjacent circles shoshould be a prime. Note: The number of First Circle shoshould

In this algorithm, the markup method is used to find the augmented path and improve the network stream. The process of marking is not described in detail. The following is a summary of the Program Implementation of marking: 1: The program needs to

64. [usaco 1.5] The Challenge of checkers ★☆Input file:checker.inOutput file:checker.outSimple comparisonTime Limit: 1 s memory limit: 128 MB [Problem description] Check a 6x6 checkers board with six pawns placed on the board so that each

Question: http://acm.zju.edu.cn/onlinejudge/showProblem.do? Problemid = 361 BFS .. Zoj's data is relative to poj's water point, direct BFs. Now, the key to this question is to judge the weight and express the coordinates of the Snake Head and the

Today, I suddenly thought of a metaphor for the gray XX of a bipartite graph, so I should write it down quickly. Assume that the group of boys is R1, the group of girls is R2, and the group of boys is M1, M2 ...... Girls are marked as W1, W2 .......

Question: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1179 Bare question .. The maximum matching of a bipartite graph. , The following is the 1179 AC code: #include#includeusing namespace std;const int maxn = 110;int n,m,k;int