jordan x1

HDU 4311Test instructions: There are n points on the plane, one point (x, y) can only reach (X-1,y), (X+1,y), (×, y-1), (x, y+1) 4 points. Find a point from N points to minimize the sum of the distance from the other point to this point.Ideas:It can be found that the distance between the two points is |x1-x2| + |y1-y2|, which is the distance between two points of Manhattan.The naïve approach is to traverse all points and enumerate the sum of the dista

test case starts with a line contains three number N, M (2 OutputFor each test case, you shocould print the minimum steps. "Bad Luck !" Will be print, if they can't meet each other. Sample Input4XXXX. Z ... XS.XXXX4XXXX. Z ... X. SXXXX4XXXX. ZX.. XS.XXXX Sample Output11Bad Luck! S and Z are in the same maze. One of them takes one step, and the other takes one step in the opposite direction. How many steps can be taken to the same location or the two are adjacent? Idea: open a four-dimensional

POJ 3658 MatrixDouble two points, WA for an afternoon, I really do not understand why a two-point writing will enter the cycle of death.INF to set a larger, the subject set 0x3f3f3f3f will WA.There are negative numbers in the subject, the results of two-time (L+R)/2 and (L+R) >>1 are different ;such as L=0,r=-1, then (l+r)/2=0, and (L+r) >>1=-1, and we need the correct answer is-1, so the first two points must be written (l+r) >>1The following two kinds of two can be used:(l+r) >>1/** Fillname:

From: http://www.cnblogs.com/DSChan/p/4862019.htmlThe topic said to find two non-intersecting paths, in fact, can also be equivalent to (from) to (N,m) the two disjoint path.If you are looking for only one, then return to the most classic dp[i][j] = max (dp[i-1][j],dp[i][j-1]) + a[i][j].Now find two, you can start the array to four-dimensional. Dp[x1][y1][x2][y2] = max{ DP[X1][Y1-1][X2][Y2-1],

print, if they can't meet each other. Sample Input4XXXX. Z ... XS.XXXX4XXXX. Z ... X. SXXXX4XXXX. ZX.. XS.XXXX Sample Output11Bad Luck! S and Z are in the same maze. One of them takes one step, and the other takes one step in the opposite direction. How many steps can be taken to the same location or the two are adjacent? Idea: open a four-dimensional array record. Note that the initial position of the two persons must be set to "." Open Space. Originally, I opened two 3D arrays at the beginni

purchase (1,0,0,0,0) is the same as the (0,1,0,0,0) effect. This can be simplified to allow the purchased book to increase (decrement) in accordance with this book, thus facilitating discussion. The parameters to be processed are the number of purchases for each volume, so recursion must be related to these five parameters. The parameters can be sorted in order from small to large. Discusses the number of arguments that are not 0, thus finding all possible types of discounts. The lowest price i

), Shanghai Futures Exchange rebar (RU) and hot coil (HC).The data set is March 15, 2016, the day open trading data, The price data for the minute line of the black system of 5 futures Contracts.# Data set already exists DF variable in > head (df,20) x1 x2 x3 x4 y2016-03-15 09:01:00 754.5 616.5 426.5 2215 205 52016-03-15 09:02:00 752.5 614.5 423.5 2206 20482016-03-15 09:03:00 753.0 614.0 423.0 2199 20442016-03-15 09:04:00 752.5 6 13.0 422.5 2197 20402

. Disadvantages of using virtual functions as interfaces It is difficult to use virtual functions as interfaces in binary compatibility: "Once released, it cannot be modified ". Suppose I want to add several drawing functions to graphics while maintaining binary compatibility. The coordinates of these new functions are represented by floating-point numbers. My ideal new interface is: --- Old/graphics. h 13:12:44. 000000000 + 0800 ++ new/graphics. h 13:13:30. 000000000 + 0800 @-+ @ Class grap

Rough Set TheoryIn the face of increasing databases, how can people find useful knowledge from these vast data? How can we refine what we have learned? What is a rough line description of a thing? What is a thin line description? Rough set theory answers the above questions. To understand the idea of rough set theory, we must first understand what is knowledge? Assume that eight blocks constitute a set, a = {x1, x2, X3, X4, X5, X6, X7, X8 }, each bl

structures. (Ii) fragment sets cannot be described in traditional geometric languages. They are neither trajectory of points that meet certain conditions nor solutions of some simple equations. (Iii) A fragment set has some form of self-similarity, which may be an approximate self-similarity or a statistical self-similarity. (Iv) generally, the "fragment dimension" of the fragment set is strictly greater than its corresponding topological dimension. (V) In most situations of interest, the fragm

have Division operators. The ". \" and "./" operators represent the left and right division of Array Operations, respectively, indicating that the corresponding elements of the array are mutually exclusive. During array division, the two arrays must have the same size unless one of them is a scalar. [Example 3.3] The known matrices X1 and X2 are calculated as x1/X2 and

.(iv) The "fractal Dimension" of a fractal set is strictly greater than its corresponding topological dimension.(v) In most interesting cases, the fractal set is defined by a very simple method and may be generated by the iteration of the transformation.When writing fractal in Java, different graphs call the recursive implementation according to different representations, such as:Koch Curve: Copy Code code as follows: public void draw1 (int x1