Others

Set a [I] to the number of sweets for the I-th child, and D [I] to the number of sweets for the I-th child relative to the 1st child, that is: D [I] = A [I]-A [1], d [1] = 0. A B c includes a [B]-A [a] The question is to find the maximum

// 3d maze // standard BFS # include # include # include using namespace STD; struct coordinate {int X, Y, Z, step;}; int L, R, C; bool isvisited [31] [31] [31]; bool place [31] [31] [31]; coordinate goal; coordinate start; int times; void BFS ();

Numerical Computation has just learned the Newton Iteration Method to Calculate the zero point of the equation. Today we can see that poj has questions about this. The key to this question is to know the formula. G (x) = x-(x-A/X)/2 can be

I thought I had mastered BFs. This afternoon I was stuck with this question. Previously, the maze was a separate human-state maze, and the status of the queue was a coordinate, this question is about two people, two States. At the beginning, I

BFS: This question has been wa for several times and cannot be understood. Later, I found that I was wrong in determining whether the status is legal. I mistakenly thought that it must be within the specified range of two numbers, in fact, it only

View code DP [I] [J]>? = DP [I] [k] + dp [k + 1] [J]; If (s [I] = '(' & S [J] = ') '| s [I] =' ['& S [J] ='] ')DP [I] [J] = max (DP [I] [J], DP [I + 1] [J-1] + 2 ); Transfer Process # Include # Include String . H> # Define Max (A, B) A> B?

There are n computers that have crashed, and there are two kinds of operations. O indicates that a computer is repaired, and then the relationship with other computers that have been repaired can be updated, that is, if you are connected to a

Returns the minimum cyclic representation of a string:   The two strings mentioned above are homogeneous. Instead of finding min (s) directly, they move through pointers. When a string is matched for a long time, the position is Min (s ). The

This is a cup ~~~ Simple DFS, WA, was found countless times, and later it was found that every time cases forgot to clear the Vector Array again, it was dizzy ~~~ # Include # include # include # include using namespace STD; struct info {int ID;

It is easy to calculate the number of cut points. Difficult in some details It is unclear why dfn is set to 1 at the beginning. Why is it wrong? IncorrectCode View code # Include # Include String . H> Int N, son, ans; Int Map [ 1000 ] [

It can be obtained from A to B only when the shortest path from B to the end is smaller than the shortest path from A to the end. There are several such paths. I used Dijkstra to do it all over again. The details need to be carefully

View code Discretization is required, but it is much easier to use map. # Include # Include String . H># Include Using Namespace STD; Const Int Maxn = 10010 ; Int Rank [maxn], p [maxn]; Int N, m; Void Init (){ Int I; For (I = 0 ; I 10000

View code # Include Stdio. h > # Include String . H > Int Prime [ 10000 ]; Int Vis [ 10000 ]; Int Ans; Int A [ 10000 ]; Void Init (){ Int I, J; Int N = 12997 ;Memset (VIS, 0 , Sizeof (VIS )); For (I = 2

Today, I am so worried that I have learned how to write the shortest path in the future.AlgorithmIn combination with the methods on the Internet and books, we finally understand the general templates and ideas. I first found a few questions and

Convert to the maximum match. Each horizontal 'O' and '#' block (must contain 'O') serves as a vertex of the X set, each vertical 'O' and '#' blocks (must contain 'O') serve as a vertex of the Y set. When 'O' at the intersection of the

The question is given at any time by four vertices, and the distance from the smallest vertex to the four vertices is obtained. If the quadrilateral is convex, The Fermat point is the diagonal point, otherwise it is the concave point. The proof

The idea of determining whether the center of gravity is on the side of each convex hull is on the side of the convex hull is very clear, that is, it is a bit annoying to implement. Here is a bit wrong, there is a bit wrong, so, in the future, I

# Include # include # define Max 1005 using namespace STD; char result [Max]; char a [Max]; char B [Max]; int result_size; void add (); int main () {int N; while (CIN> N) {CIN> result; If (n = 1) {cout B; add ();} int begin = r Esult_size-1; for (

Let's talk about the bipartite graph. I will also be able to review it later (* ^__ ^ ...... The proof of some basic theorem will no longer be mentioned. There are a lot of books and online .... To learn a bipartite graph, you must first know

// Prim algorithm # include # include # define INF 1000000 # define MAX 200 using namespace std; int main () {int arcs [MAX] [MAX]; bool isvisit [MAX]; int min_weight [MAX]; int N, Q; int x, y; freopen ("C: \ Users \ Haojian \ Desktop \ test.txt",