Others

A s * a diagram is given. Some of the vertices are the starting point. Each intersection can only go through once and ask if all vertices can go to the edge of the diagram. This topic mainly describes how to create a graph. Each vertex can only go

Question: Determine whether the given directed graph is semi-connected. Semi-join diagram: In Figure G, any two points U, V, u can reach V or V can reach U. I have been searching for it online for a long time. Except for the information

Memory-based search: the reverse search is much slower than the current search, with a latency of 172 ms and 16 Ms.   Code: /* # Include using namespace STD; __ int64 map [40] [40], F [40] [40]; int N; __ int64 DFS (int I, Int J) { If (F [I]

Sort the size of N numbers, you need to know at most N * (N-1)/2 size relationship This question allows you to find the least logarithm on the basis of the maximum N * (N-1)/2, because to ensure that the sequence can be fully ranked after the C

Enhanced version 3041 Because the lawn cannot be covered by wooden boards, you need to deal with it more.   Since the wooden boards can only be placed horizontally or vertically, the first time the numbers of boards that can be placed

The two questions share the same meaning, and 3177 of the data is very small. If 3522 of the data is handed in, you don't have to change the size...   This topic indicates that at least two paths can be reached between any two points in an

1 ~ Sum of every number in N and the maximum common number in N In my method, we first break down n by means of formula, and then DFS finds all the approx. The maximum approx. N must be a factor of n. We only need to know that for each d | n, gcd (I,

A topic in topological sorting. In the question, a Topology Sorting is performed by checking whether the inbound degree is 0. Note that if there are multiple inbound 0 points, there may also be loops. For example, this set of data: 6 6 A B C D

For the minimum tree structure and zhu liu algorithm, see the following steps: Http://hi.baidu.com/goldengoatish/blog/item/a8e693d8aad5122611df9b2e.html/cmtid/0b36bd097aac9f980a7b8295   Code: # Include # include using namespace STD; const int

In an undirected graph, multiple edges may exist between each pair of vertices. The minimum number of edges deleted can be divided into two subgraphs.   Considering the number of edges between two points as the weight, it becomes the minimum cut for

At the beginning, I didn't understand the meaning of the question clearly. I thought that the two sides of the edge that can be deleted by satellite channels in the Minimum Spanning Tree must have satellites. In this way, the second satellite

Recently, we have made more than 10 largest streams, mainly including the following types:   1. Bare maximum stream poj 1459 poj 1273   2. Split the vertex and convert the restriction of a vertex to the edge limit. poj 3436 poj 3498 poj 3281  

The shortest time can make the ox go to the cowshed. First, the shortest of each point is obtained, and then the second answer is obtained.   In the diagram, the source point is connected to each cowshed I to an edge with a capacity of the initial

Know the circumstances in which (x) = (x * (x-1)/2 mod n is a full residual system of N (starting from 0 ), however, I didn't have a good idea for a YY lesson. I came back and saw the proof of Daniel. After studying it for a while, I finally

At the beginning, the question was wrong. In fact, each group was required to have a maximum of several people. I went to find the largest group number... Margin, size is understood as that...   After correctly understanding the meaning of the

This is a hard topic of data... I met during the exercise competition and spent a long time with my teammate yy. I didn't expect how to express the N 8 s. First, due to the particularity (every bit is 8), we put M = 888... 8 (N 8) indicates M = 8*(10

It is still the question of Euler's path, but this time we need to determine the path with the smallest Lexicographic Order after the existence of Euler's path, first sort the words in Lexicographic Order, and then determine whether it is Euler's

The DP equation is DP [I] = min {DP [J]} + 1, 2 * A Transfer is performed directly by L ^ 2, but J is within the range determined by I. Therefore, monotonous queue optimization can be used. In addition, it is troublesome to note that if I is in the

Question: give you a group of words to determine whether these words can be arranged so that the last letter of the previous word is the start Letter of the next word. If yes, the sorting is printed. Train of Thought: Take the first letter and last

Define DP [I] [J] [k] to indicate the I-th lead, which consumes J points of energy and takes the minimum time of K circles. If the leader is replaced at this time, DP [I] [k] [k] = min {DP [I-1] [J] [K], DP [I] [k] [k]} Otherwise, DP [I] [J] [k] =