Others

View more problem solving reports: http://blog.csdn.net/wangjian8006/article/details/7870410 Reprinted with the source: http://blog.csdn.net/wangjian8006 The meaning of the question is too difficult to understand, but it is better to

Want to see more problem-solving reports:Http://blog.csdn.net/wangjian8006/article/details/7870410Reprinted please indicate the source:Http://blog.csdn.net/wangjian8006 Question: Give a sequence of non-negative integers and ask whether the

Original question connection: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4501 Idea: 3D ~~~~~ ACCode: # Include # include #include #include # include using namespace STD; const int max = 100 + 10; const int base = 2; const int INF

We think of a two-dimensional chart as a kinetic energy system, where each two nodes have a force. We can think of this force as the spring elasticity, so that the whole kinetic energy system can be minimized, the balance is reached. According to

Original question connection: http://poj.org/problem? Id = 1113 Give N points. You can see a wall so that the distance between all points and the wall is no less than l. Length of the wall .. Idea: first obtain the convex hull of N points, and then

Original question link: http://acm.nyist.net/JudgeOnline/problem.php? PID = 1, 104 Nyoj is a Chinese question. It is easy to understand. This question is to find a sub-matrix in a matrix. The sub-matrix and the maximum !! The output is the largest

Start with the duck application. A duck simulation game contains various ducks. We need to use OO technology to implement this system. 1. Define a duck superclass and define the characteristics of ducks. Then different ducks are used as subclasses

Inheritance cannot solve the problem well, because the duck behavior will change constantly in the subclass. To adapt to this change, we have to overwrite the parent class method in the subclass over and over again. The interface cannot solve this

Prim (addition method) 1. Select either of them (generally 1). As the starting point, set the distance from the minimum spanning tree to 0 (in fact, it is to select a vertex and materialized the tree ),. 2. select the shortest distance from the

Description As a co-partner of cooperation and mutual assistance. Anemones are the most competent guard for cancer. It uses toxic tentacles to sting all the animals that dare to come close to them and protect them. While the zombie crab carrying the

Want to see more problem-solving reports:Http://blog.csdn.net/wangjian8006/article/details/7870410Reprinted please indicate the source: http://blog.csdn.net/wangjian8006 There are n cities and M roads with a carrying capacity on each road. Now the

Want to see more problem-solving reports: http://blog.csdn.net/wangjian8006/article/details/7870410Reprinted please indicate the source: http://blog.csdn.net/wangjian8006   The following figure shows an undirected graph with a security factor F,F is

Want to see more problem-solving reports:Http://blog.csdn.net/wangjian8006/article/details/7870410Reprinted please indicate the source: http://blog.csdn.net/wangjian8006 Give n worms, then a mate with B, give m to A and B, and then askAre there any

10-1-2: The two stacks start from both ends of the array and expand to the middle; 10-1-5: This deque code has previously been implemented (C ++ STL) and will not be written here. The head and tail point to the center of the array at the beginning; 1

A vector is a dynamic array. STL source code: // Myvector. h # include "mymemory. H "# include" myiterator. H "# include" myconstruct. H "Using STD: copy_backward; Using STD: Max; Template class vector {public: typedef t value_type; // after this

Ek (edmondskarp) algorithm: this algorithm is improved by the Ford-Fulkerson Algorithm. The Ford-Fulkerson Algorithm is constantly used to search for an augmented path, and then judge the minimum traffic of a single path, next, we add a stream to

Want to see more problem-solving reports: http://blog.csdn.net/wangjian8006/article/details/7870410Reprinted please indicate the source: http://blog.csdn.net/wangjian8006 There are n man and N home in the figure, and one person can only live in one

  Reprinted please indicate the source: Thank youHttp://user.qzone.qq.com/289065406/blog/1299148520   Tip: Very annoying and very simple chess board simulation, it is troublesome to output... It is the opposite situation of poj2996. A serious

  Reprinted please indicate the source: Thank you Http://user.qzone.qq.com/289065406/blog/1303639118   Question: It is known that the initial states of the two heap cards S1 and S2 are all C, and they can be combined into a heap of S12 according to

Http://codeforces.com/contest/279/problem/A A: You can draw a drawing on your own to understand the law. Let's give you a point and ask how many turns this point has taken on the spiral. Thought: I did it through simulation. Because the data volume