Others

Author: Unknown please contact me quickly from: http://blog.csdn.net/ycl111/ In web system development, we often need to read and set some system configuration items, such as database connection strings and upload paths. In the original ASP system,

This question uses the KM algorithm to calculate the maximum weight. However, if the value is the smallest, the conversion is required, Initialize the map to the negative infinity, and then map the negative weight, so that a small distance becomes

Question: To give a graph, we need to go down from a vertex along the edge. Each side only goes once, and all the edges go through and return to the path with the smallest Lexicographic Order of the origin. In the input, the three numbers in each

  Topology Sorting simply sorts all nodes in a graph so that the U corresponding to each directed edge (u, v) is placed in front of v. The biggest purpose of topological sorting is to judge whether a directed graph has a ring. Of course, another

# Include # include int f [1006] [1006]; int main () {int m, n, I, J, K, H; while (scanf ("% d ", & M, & N )! = EOF) {memset (F, 0, sizeof (f); F [0] [0] = 1; for (I = 1; I = 10) {f [J] [k + 1] = f [J] [k + 1] + F [J] [k]/10; f [J] [k] = f [J] [k]

# Include # include # define INF 0x7fffffff // is the best way to define an infinite constant .. Int map [301] [301]; int lx [301], Ly [301]; int SX [301], Sy [301]; // SX [], sy [] indicates whether the Left or Right vertex I is in the Hungary

Students have their own favorite courses. Therefore, for a course, multiple students may like it, but we want to have candidates for none of them. The first data indicates the number of tests, followed by P courses and N students, In the next row of

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4006 Analysis:There are many methods, but if you want to save trouble,You can use the priority queue to store only the first K of data.   # Include # Include # Include Using namespace STD;Struct point{

Similar to artillery positions .. /* [General idea] similar to the above question, a matrix composed of a square, each square can be represented by a scale gun with 0,It is not allowed to use 1 as an extension gun (the original question is

# Include # Include # Include # Include Int CMP (const void * a, const void * B){Return * (char *) B-* (char *);}Int main (){Int target, Len, C [50000], flag, I, j, W, R, Q;Char A [50000];While (scanf ("% d % s", & target, )! = EOF){If (target = 0 &

This question can be pushed forward to the number of all BITs by the known last bits of the first multiplier. For example: The given base number is 10, the last digit of the first multiplier is 7, and the second multiplier is 4. List the following

S S1 V1 S2 V2 is known; x S1 and Y S2 are available; x * S1 + y * S2 is used to evaluate max (x * V1 + y * V2) Give a backpack the capacity n, the cost of the two items A, C, and value B, d, and ask how much value can be loaded at most.   Analysis:

The same method; # Include "string. H"# Include "stdio. H"# Include "queue"# Define INF 9999999Using namespace STD;Int R [300] [300];Int pre [300];Int visit [300];Int n, m;Int BFS (int s, int T){Int P, I;Queue q;Memset (visit, 0, sizeof (visit

  // The difficulty of this question is how to create a graph. Let R get a certain value ..// Each customer is represented by a node.// For the first customer in each pigsty, the edge is connected from the source point, and the capacity is the

This question requires that all strings be generated in Lexicographic Order and cannot be repeated (but the characters can be repeated and case sensitive ). The basic idea is to first sort the input strings in Lexicographic Order, then recursively

This is a simple graph topic. You only need to use the width-first search (BFS) to mark the distance between nodes. My problem-solving code is as follows: # Include # include # include # include # include # include # include # include using

Use Floyd to calculate the maximum value.   # Include "stdio. H"# Include "string. H"Double map [1010] [1010];# Define max (A, B) A> B? A: B seems to save time, otherwise it will time out ..Int main (){Int m, n, I, J, K, H, P; While (scanf ("% d", &

Depressing: A question that is easy to understand, the first decisive timeout; With the first experience, the distance between two people is also stored in the process of searching for two people; The result is incorrect. I went to xuexiao for one

First, let's take a look at the problem of maximal spanning tree (MST. Problem: for a given undirected Weighted Graph G = (V, E), the vertex set is V, and the edge set is E. It is required to select a subset of edge set E, so that e can connect all

This question requires us to find the minimum value of "the most powerful value in the path" between the given two nodes (one starting point and one ending point, but this is an undirected graph) in the graph, which is undoubtedly a dynamic plan. At