Others

You can go to CF to find the question. Analysis process: If it is an even number, it is directly equal to dividing by 2, for example, F (8) = f (4) = F (2) = F (1) If it is an odd number, add 1 after dividing by 2 directly, for example, F (1) = f (0)

To solve this problem, we must first understand the next array in KMP. Now we think this next array is really important !!! To find the length of all the substrings of a string that are both prefix and suffix, you must know the meaning of the next

This question is a problem of the maximum flow of minimum cost. From this question, I better understand what the maximum flow of minimum cost is, while finding the shortest path, we also need to take into account the maximum traffic and the residual

This is a typical problem of the minimal spanning tree. Set the existing edge weight to 0. Below isCode: # Include # include # include # include using namespace STD; const int n = 800; const double INF = 10000000; int N, m; Double X [N], Y

A very bare minimum bottleneck path template question, first find the minimum spanning tree, and then find the point-to-point minimum bottleneck path CodeAs follows: # Include # include # include # include using namespace STD; const int n =

First, create a minimal spanning tree. Then, check that there are several connected components, and then create several airports. Finally, all the edges that are more expensive than the airport are deleted from the selected edges, add the number of

First, writeCode, Be careful; Second, in pojAlgorithmThere is almost no error. When the idea is correct, it still times out. Check whether the type of the compilation you submitted is g ++ or GCC. If yes, change it to C ++! This is a typical

The deep mining of DFS is divided into several parts. Today we have learned about three parts. First, the connected component (and the query set can also be done) Determine the number of connected components of a graph and label each

This is a very simple topic of the largest stream. The question is how to create a diagram. Allocate shirts and distribute them to volunteers. Each volunteer can accept two types of size, each of which has the same quantity, each dress has a hand

This is a typical theorem for the maximum flow of the smallest cut. Through this question, I once again learned the definition of the smallest cut. The minimum cut is the smallest cut of the total capacity in all the cutovers. This is my

It is a pity that this question has been wa three times, but it is actually very simple! The first time is re, 32*32 = 1024. It's a shame! The second time I did not pay attention to it. (x, y) indicates column X in row Y. Based on the original

Calculate the maximum independent point set for the connected edge that may exist together. Code: #include #include #include #include #include using namespace std;const int N = 550;struct pupils { int h; string sex; string music; string

Hoj2275 (water question) Question: In the computing sequence a [], when I A [K], the number of such three tuples. Analysis: first, we can use the number a [J] as the center point to calculate the number of vertices earlier than it and the number of

The bell-man algorithm and Dijkstra algorithm are both shortest paths and can be used for finding the shortest paths of single-source points. What are their differences? After thinking for a long time, how can we sum up the differences between them?

This is a by-product question of binary matching. Question: N * n matrix. There is a number in each lattice. W [I] [J], assign a value to each row and each column so that any grid has a value. W [I] [J] Output row and Col, and the minimum value of

This question is used to check the application of the set. It is a good question type. I also refer to other people's ideas, but the idea is very simple. I have mentioned a lot of complicated things about friends and enemies. You will find that,

This question was first written in the adjacent table, WA, and then changed the matrix. The result is still incorrect, but I found something wrong. It is mainly to create a graph and determine whether the two points are the starting point or sink

This question is worth consideration. Evaluate: determine whether there is a minimum spanning tree. If there is a small Spanning Tree, the total weight of the secondary spanning tree is output. It should be noted that there is a duplicate edge

Note the data type. Double is used! #include #include #include const int N = 110;struct Node { double x, y;}point[N];int n;double g[N][N];const double INF = 10000000000.0;const double eps = 1e-9;double prim() { double ans = 0.0, mi; bool

Question: there are multiple paths between any two points. The maximum weight of each path is different. In other words, from one point to another, all the edges passing through, the largest value is the maximum permission of this path. The maximum