Others

/* A typical 2-Sat question has a radius of two points X and Y. In this case, X is connected to YY (that is, Y's opposite point ), Y connects one link to XX and then requires a strong Unicom component. If X to XX is a Unicom component, the condition

/* Obviously, if A and B are on the same side of a straight line, min (PA + Pb) = DIS (a, B); otherwise, obtain B's symmetric point on the straight line B ', min (PA + Pb) = DIS (A, B ') */# include # include # include using namespace STD; int

# Include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include using namespace STD; int A [20

/***************************************: Given a string, the longest repeated substring that appears at least K times can overlap; Algorithm Analysis: This question is similar to pku1743. It is also the first two answers, and then the suffix is

Poj3## include # include # include using namespace std; const int hash_size = 60007; const int INF = 100000; int n, m; int map [20] [20]; int Pow [40]; struct node {int hash_chart [hash_size], sz; int msk [hash_size]; int dp [hash_size]; int next

/* The maximum permission closure is classic. For a vertex connection vertex, the edge weight is the cost value, the Source Vertex, And the edge weight is the Earned value. The two points have constraints. a-> B, connect a single edge B-> a; the sum

/* Reference: locate the range of these vertices, and use two vertices (E1 and E2 in the Code). 2. Generate num vertices within the range (Num-customized) 3. For each generated vertex I, generate num points around it. If it is a bit better than I,

/*************************************** * ** Data structure: splay_Tree: Stretch tree; nature: the extension tree is an improvement of the Binary Search Tree. Like the Binary Search Tree, the extension tree is also ordered. That is, each node x in

/*************************************** * ********* The subject is as follows: there is a rectangle advertisement board with H * W, and advertisements should be placed on the top; then n 1 * WI advertisements should be pasted on; and advertisements

/*************************************** * ****** The subject is as follows: 0 a B converts all the numbers in the range [a, B] to 01 a B and all the numbers in the range [a, B] to 12 a B, in B], there are 0 1 SWAPs, and 0 is changed to 03 a B. The

/*************************************** * ************* The subject is as follows: john's farm has N plots of land with M routes and W wormhole holes. The wormhole holes are one-way routes that will deliver you to your destination before you leave;

/*************************************** * ******* Question address: the distance (1) "1 a" indicates that a car with a length of a is driving in to find a parking space. The parking space must be at least B from the car in front of it, the distance

/** Algorithm Introduction: * The Simple Algorithm for Finding the minimum loop in a graph G is: Find an edge and delete the shortest path between the two points. * If this algorithm can be obtained, the shortest path and the original edge form a

/*************************************** * ************* Question: peter invited A friend to his party, but the invited person must meet the following requirements: at least A person who knows and B does not know each other at the party; calculate

/*************************************** * ************** Question: returns two strings A and B, and converts string a to string B. Each time you can change a continuous interval to the same character, you can ask the minimum number of operations

/*************************************** **************************************** * ***** Tree arrays include one-dimensional tree arrays and two-dimensional tree arrays; the main problem model is the known array a [n]. The subscript starts from 1

/***************************************: A polygon has n vertices. Input m straight lines and output their length in the polygon respectively. The boundary is also calculated as an algorithm: obtain all the intersections between a straight line and

# Include # include # include # include using namespace std; const int N = 100000; // The maximum length of the text string const int M = 100; // the maximum length of the mode string int n; // the actual length of the text string int m; // the

/*************************************** * ************* Question: there are n tasks, which are known to be the minimum time and maximum time to complete each task. If the total time spent on completing a task exceeds the maximum time, the penalty

/***************************************: There are n different kinds of rectangular bricks, and each type of bricks is inexhaustible; bricks can be flipped, that is, any side can be used as the bottom surface, the remaining side as high; stacked