Others

Question: Give an edge, the condition passing through the edge, and the result of passing through the edge (condition: whether the bug exists or not, result: fix those bugs and add those bugs), and find the shortest path. At first, I began to

Bitwise operations are very powerful. If a is different from B = K, you can determine how many bits are different for K. During calculation, the field can be computed using bitwise operations, in short, bitwise operations are very powerful! #

The number of points that can be seen when T [I] is X = y = I Consider the case of x 1, then (x/d)/(y/d) must be the point we can see before, and (x, y) will be covered.   When x> Y, It is symmetric like x   So T [I] = T [I-1] + 2 * Phi [I], I = 0,

The diagram is very important... Each movie acts as a source point, and then regards every day of every week as a point. Each point can only contribute one working day, that is, the outbound (to the sink point) capacity can only be 1, the size of

A question that tests the Thinking Ability The most stupid method was used at first, one by one, and the result could not be reached from K to 10.   After reading discuss, we can push the formula so that we can directly push the next murder location

The stoer-Wagner algorithm can be used to solve the problem of at least two unconnected cities with weighted and undirected edges.   Code:# Include using namespace STD; const int INF = 1 const int max = 510; int G [Max] [Max]; int mincut (int

The Application of Floyd modifies the judgment conditions, but it is not initialized. It begins to ignore a special situation where there is no direct link between the two points and is indirectly linked together. CIN is really slow!   Code:   #

Http://poj.org/problem? Id = 2985 The tree array is amazing. In the past, it could still find elements smaller than K... orz, and calculate V5! # Define N (1 = 0; I --) {// Inverse Simulation of the sum of the tree array, ANS + = (1 = n | CNT + C

Poj 3352 and poj 3177 are actually the same, except that 3177 may have a duplicate edge, which requires special judgment. 3352 ask if one side is removed after the transformation and the other side is still connected. 3177 if any two points after

#define N 1000005int c4[N*5],c7[N*5];int c47[N*5],c74[N*5];bool mark[N*5];char str[N];void up(int id){ c4[id] = c4[idt)return ; mark[id] = 0; if(s == t){ if(str[s] == '4'){ c4[id] = 1; c7[id] = 0; } else {

Although it was done by someone else, it was a bit hard to understand his mark array vis, because he marked the reverse side, and I used to mark points, so it took a long time, finally let me want to understand, if you want to mark the point,

Here we need to add the super source point and the super sink point, respectively N and n + 1, and then use EK to find the maximum stream, because the complexity of EK is O (V * E ), so the time is very slow. There are other optimization algorithms

A water #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long long#define pii pair#define bug cout>n; int i; int s,t;

See this PPT clear http://wenku.baidu.com/view/03d35d1c59eef8c75fbfb3b4.html #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define

This question is a little different from that of poj 3041. This is not a whole line of elimination, but a few consecutive grids are eliminated together. Therefore, pay attention to this when composing a diagram, from top to bottom, each row is

# Include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include using namespace STD; # define ll long # define min int_min #

Two parallel lines, AB, CD, and AB, are given. The speed of CD is Q, and the line segment is R. How long is the shortest time from A to D? Method: 3 points. After a simple analysis, we found that this function is a single-peak function, which is

It seems that TLE has been around for 10 times... I don't remember where to change it. It may be initialization problems! # Include # include # include # include # include # include # include # include # include # include # include #

Because the regular convex hull is saved counter-clockwise, you only need to find the point in the upper left corner, and then go back to it to OK! The original template did not judge the common points, resulting in n times of Wa !!! # Include #

Classic ry, where the unit circle covers a maximum of points. Here we use the O (N ^ 3) algorithm, which indicates that there is O (n ^ 2 * logn), but it won't. Method: Enumerate any two points and use this as the string to create a new circle. (PS: