Others

 Harry Potter and the Final Battle Time Limit: 5000/3000 MS (Java/others) memory limit: 65536/65536 K (Java/Others)Total submission (s): 294 accepted submission (s): 97Problem DescriptionThe final battle is coming. now Harry Potter is located at

In fact, a question in Liu lujia's book has been changed a little. Similar to a simulated question, it is difficult to look at the question. In fact, the meaning is very simple, once again AC # include # include # include using namespace std; int

/* From: http://www.cppblog.com/Yuan/archive/2010/09/02/125667.html? Opt = admin slightly rewrite there are n (n # include # include # include using namespace std; const int MAXN = 20010; int fa [MAXN], val [MAXN]; int n, q; void init (int n)

View the data structure from the K elementThis article discusses the K-th or K-th small elements in the sequence, because the K-th large element can be converted to the N-K + 1Small element (N is the length of the sequence), so this article focuses

/*************************************** * ****** Question address: http://acm.whu.edu.cn/land/problem/detail? Problem_id = 1461 define a function to evaluate the ch value (see the comments section below); that is, the method to evaluate the ch

/***************************************: Given two strings a and B, the longest common substring is obtained. algorithm idea: Any substring of a string is the prefix of A suffix of the string; the longest common substring of A and B is equivalent

/*************************************** * ****** The subject is as follows: there is a hotel with N rooms in a row. There are two operations: first, a customer wants to stay in a consecutive room; and the location of the smallest left endpoint must

/*************************************** * ** Question: A capacity network with the upper and lower limits of traffic without the Source and Sink points is given. A Feasible stream meeting the traffic balance condition is obtained. The algorithm

/*************************************** * ***** Question: provides many words and counts the number of words prefixed with a certain string (the word itself is also its own prefix). algorithm analysis: dictionary tree template question; ************

/*************************************** * ****************** Algorithm introduction: given a completely bipartite graph G = (x ∪ y, X × y), the edge (x, y) has the right to W (x, y ); find a matching m with the maximum weight from X to Y, that is,

/*************************************** * ***** Question address: values (sa [1]), suffix (sa [2]), suffix (sa [3]),…, Suffix (sa [n]) sequence calculation; we can see that for each newly added suffix (sa [k]), it will generate n-sa [k] + 1 new

/*************************************** * ******** Data structure: suffix array (Suffix_Array); substring: substring of string S r [I .. j], I ≤ j, indicates the r string from I to j, that is, sequential arrangement of r [I], r [I + 1],..., A

/* Once we see the range of N and K and the type of the question, we should think of the relationship with DP, first sort by Bi from large to small (descending and quick early election, here is the greedy idea) DP [I] [J] indicates that the first I

/** Algorithm Introduction: * For an undirected graph containing M edges of N nodes, calculate the minimum number of spanning trees t (G). ** algorithm idea: * aside from the limit of "minimum", we can use the Matrix-Tree theorem to obtain the

# Include # include # define N 60 # define v n * N int L [V], R [V]; // records the bidirectional chain table int U [V] in the left and right directions. D [V]; // record the two-way linked list int C [V] in the upper and lower directions; // The

/* A binary tree maps each subtree to an integer. For example, the left and right children of node N are L, R, then, take the integer rn corresponding to the r of the ln subtree corresponding to the subtree L, and set the pair (LN, RN) corresponding

In the past few days, I have watched Linux Application Programming and tested the fork function. Doesn't it mean that the sub-process will start running from the fork statement? Why is the previous printf content still output. I found it online.

/* The Problem of minimum weighted matching in a bipartite graph is obvious in the condition given by the question. The maximum traffic with the minimum cost is used to solve the Connection source point of X sets. The Edge Weight is 1, and the cost

Description: The question is very simple. First, sort it out and select it from it, because I think it is a bit difficult to use arrays, so the struct # include # include struct Ele {int We; int Iq; int sum; int next; int pos ;}; Ele count [1010]

/* This topic is not the minimum tree structure of a fixed root. We can Virtualize a root, and then connect the root to each vertex. The connected vertex can be set to infinity, or set all edges and bigger values, for example, r, and then use the