C++

I wrote a proof before. paste it directly.The reverse verification method is mainly used:Suppose the path s-t is the diameter of the tree, or the longest path on the tree.According to the existing conclusion, the farthest point searched from any

Question: give you a sum, then give you a n, then give you n, and then find some numbers from n, so that the sum of these numbers is n. The number of n given is decreasing, so that the output result is also output in the form of decreasing.Idea:

It's easy to figure out how to make achievements. He asked the maximum number of k consecutive values. You can use 1 ~ K sum, 2 ~ Sum of k + 1, 3 ~ The sum of k + 2... as the node. Then we found that it became a simple issue of Interval Update and

Description:There are six kinds of jewelry with different values. Ask if you can divide these jewelry into two equal values. Of course, each jewelry cannot be cut.Obviously, this is a backpack problem. Due to the huge number of jewels, we need to

This topic is a method that a good friend told me. I typed out the code according to my own understanding. Therefore, we hope to share the algorithm flow and code with you. Question: A bar Statistical Chart (histogram) is provided. The width of each

There is a wooden stick with a length of l. There are m cutting points on the wooden stick, and each cut will have to pay the current length of the wooden stick, ask how to cut the minimum price   Solution: 1-interval DP 2. interval dynamic planning

Anti-prime SequencesTime Limit: 6000/3000 ms (Java/Other) Memory Limit: 60000/30000 K (Java/Other) Total Submission (s): 8 Accepted Submission (s): 5 Problem DescriptionGiven a sequence of consecutive integers n, n + 1, n + 2 ,..., m, an anti-prime

Question: Give You n points and then find the Minimum Spanning Tree. The special feature is that some vertices are connected to edges.Train of Thought: For vertices with edges, mark them with a special mark. When adding edges, assign the weight of

Simple factory mode: Specifies the object to be instantiated. In the future, it will not add instantiated objects. In this case, you can consider using a separate class to create an instance. This is the factory.The following is an operation of 2

Question: There is A square of A * A, split it into A * A small square with 1*1, and then form k squares of B * B, with A small square left, that is, A * A = K * B + 1. In the middle, the small square is connected to k B * B Square. The shape is C

Question: it is to find the fenma point of the polygon and output the smallest distance.Http://poj.org/problem? Id = 2420Method: randomization, variable step size greedy method (Simulated Annealing ???)First, randomly select a point. I took 0, 0

C ++'s class mechanism supports polymorphism technology to solve abstract programming. It uses a lagging bundling technology,By pre-configuring the virtual function properties of the member functions, this technology enables any undefined object

Question: Give you three points on the circle and find two expressions of the circle. First, popularize knowledge: Outer circle radius: formula: a/sinA = B/sinB = c/sinC = 2R (R indicates the outer circle radius)The question can be as follows: ①.

This is to give you some points with edges between them. The number of vertices is a cut point.Idea: After the template question is completed, you can directly use an undirected graph to find a vertex template. Note that the input is troublesome. It

Question: RMQ problemTime limit = 5 second (s) Memory limit = 32000 Kb You are given large array of real numbers:A [0], a [1],..., a [N-1] Range Minimal Query problem: Problem RMQ (I, j) = "find minimum of a [I], a [I + 1],..., a [J-1]". Your

Writing compilers for game projects at hand, the attributes of the associated compilers and Game objects in the game become a major problem. After many revisions, there is a relatively good solution, if you have a better solution, please

Application of Manacher[Cpp]# Include # Include # Include # Include # Include  Using namespace std; Const int maxn = 200100; Int rad [maxn * 2];Char str [maxn], s [maxn * 2];Bool l [maxn], r [maxn];// Parameter description in the function: if the

A: There is a coastline. There is a sea above the coastline. There are some islands in the sea. The locations of these islands are known. There are radars on the coastline, and the radar coverage radius is known, ask how many radars are needed to

A derived class cannot directly access private members of a base class. to access a base class, you must use the base class interface, that is, its member functions. There are two implementation methods:1. Add protection members to the declaration

Sorry, the meaning of the question looks very complicated, so almost no one submits the question. In fact, it is no longer easy to understand the meaning of the question. No, it takes a long time to understand the question because of poor English,