Others

For absolute mode (the number of times must be greater than n/2), Division of O (n) can be performed in the worst case.Algorithm. (If two numbers are different, both numbers are discarded. If the two numbers are the same, one of them is discarded.

There are nheaded cattle and M bullpens, each of which has its own willing to go to the bullpen, please find the best match between the ox and the bullpen. The simple binary graph is a raw question. I actually got a lesson, and the data is siloat !!

Everyone will do this. Here we will analyze each method. 1. Follow the instructions to simulate it. 2. Pascal has a built-in function swap, but pay attention to the data type. longint is not 2 ^ 32 enough. int64 does not meet the function

For a graph with n vertices and m edges, each edge is charged. The minimum value of the longest edge in the path from 1 to n is calculated. K edges can be selected, regardless of the cost. The maximum and minimum answers. The Boolean array d [I, j]

There are only four heap operations in STL: make_heap ();, pop_heap ();, push_heap ();, sort_heap (); Their header file function is # include The first is make_heap (); Its function prototype is void make_heap (first_pointer, end_pointer,

Calculate the Minimum Spanning Tree of an image. Some of the edges are free of charge (which can be understood as follows ). If you use kruscal this time, add all the non-charged edges before maintenance.View code 1 program pku2421(input,output);

There are N points on the number axis, and now there are C points in the C points of N points, so that the minimum distance between the two points in the C point is the maximum. The biggest and smallest question is actually a two-point answer, and

1330 and 1470 are entry-level series, which can be basically used to test boards. 　　 1986 is a little longer than the above two, but the essence is the same for a query d [U, v] = dis [u] + dis [v]-Dis [LCA (u, v)] You can dynamically modify the

The meaning of the question is skipped, and the dots on the board are crossed in black and white. The bad point is-1. Then every knight will jump to a different color point on the premise of reasonable jump. We will link the two dots to the

To be accurate, this question is called recursion, not DP, Use F [I, j] to represent the number of solutions whose length is I and j. F [I, j] = Σ f [I-1, J-K] For the boundary, see program.View code 1 program pku2346 (input, output); 2 var 3

/** 2170.cpp** A complicated question...** DFS + hash* This speed is very slow, but the answer should be correct. paste it first .. I have no time to do this recently. Change it later ..** Improved search methods and Hash Functions** Created on: 2011

Stone scissors cloth, what is known to everyone, you can decide the order of their games, how many people may win Score: 1: This value is N for all stone scissors 2: in only two cases, the answer is the number of people that two confrontation can

There are 6 currencies with a nominal value. The smallest value is 1, and the minimum number of currencies is calculated as 1 .. 100. The maximum value and their average value are output. Subtraction can be used. For example, 6 = 1 + 2 + 3, 6 = 7-1,

/** 3253 fence repair. cpp** Created on: 2011-10-25** Huffman + heap** _ Int64 makes my wa countless times, depressing**/# Include Using namespace STD;Const int maxn = 50000 + 5;_ Int64 Len [maxn], n, size;Inline int left (int I ){Return 2 * I +

The following operations are supported when such a data structure is required: 1: Insert a node with priority P and number k 2: query the node with the highest priority, output the number, and delete it. 3: query the node with the lowest priority,

1 /*Poj-1064 cable master. cpp3 *4 * created on: 2012-2-265 * Author: longdou6 *7 *8 * binary is converted into integer storage. The lower bound is 1 (cm) and the upper bound is the longest rope length.9 *10 */11 # include 12 using namespace STD;1314

[Validated by bloggers] http://tieba.baidu.com/F? Kz= 1041263540 Because there are many INF files and different INF files correspond to different manufacturers, I found the corresponding manufacturers of various INF files

Please 　　 Method 1:   O (logn) is calculated every time Improvement: 　　　　　　 Method 2: 　　 　　 1 /*2 * N level matrix A, evaluate a +... + A ^ K, the result Mod.3 *4 * analogy: (Note that adding (instead of 1) from a is slightly different)5 * m =

Problem:There is a chain table with an unknown length. K nodes must be randomly selected as samples (that is, if n nodes exist, the probability of each node being taken is k/n, N is unknown ). The linked list can be read only once in sequence.

1 /*2 * human gene functions. cpp3 *4 * created on: 2011-12-95 *6 * similar to the longest public substring7 */89 # include 10 using namespace STD;1112 const int maxn = 100 + 5;1314 const int s [5] [5] = {5,-1,-2,-1,-3}, // score Matrix15 {-1, 5,-3,-