Others

Question: 3D space. Given the start point and end point, the minimum number of steps is required. Analysis: Generally, it is a bit difficult to read this graph and get dizzy. # Include # include # include using namespace STD; char map [11] [11]

Get the start point and end point to find the path with the least Holes The normal BFS () is enough. I want to say, oh, my god, I forgot to clear the queue. I went crazy about Wa During the simulation competition. # Include # include # include

Q: It's actually a bubble dragon game. It gives you the starting map and the position of the bubble you just played out. If the number of bubbles connected to the bubble is greater than or equal to 3, then the connected bubbles of the same color

/*   As long as the vertex's inbound or outbound degree is greater than n/2, it can be determined that it does not match the intermediate point, That is, if the answer is incremented, And the inbound or outbound degree is obtained, you can use

There may be 10 doors or keys on the way out of the castle in T-1 time, each of which corresponds to a key. A simple BFS is used to determine whether a point can pass through, rather than simply determining whether it passes through. Instead, it

As the most common method of divide and conquer, the bipartite method is applicable to monotonic functions and is used to approximate the value of a certain point. However, when a function is a convex function, the bipartite method cannot be applied.

Question: N people form a team, each from 1 ~ Select a number in M. If the two adjacent individuals select the same number, the number must be greater than K. Analysis: notices the n size, even if the 0 (N) Algorithm .. If this problem is not taken

Why is that so? How can we change the game to wa? I just changed the condition to a stricter one and removed the unnecessary judgment; HDU 4046 panda Question: Here is a string consisting of 'W' and 'B'. There are two operations for this string,

This method is based on others' questions and uses the thinking like DP, f [m] [N] = f [m] [n-1] + F [M-N] [N], F [m] [N] indicates the total number of methods for storing M fruits on N plates, because f [m] [N] Can F [m] [n-1] indicates the

Obviously, the state transfer equation: DP [I] = max (DP [J]) + G [I], (0 H [J]) However, it is noted that N ranges from 10000 to N ^ 2.Algorithm............ We can use the line tree to optimize it. Discretization the height first as the

/*   Create a trie tree and print all phone numbers recursively (print out the number of statistical times greater than 1). The hoj exists in the tree, and the stack is exploding in recursion... SecondCodeBoth are ac-enabled. Note that only one

In a certain sort of 01 backpack, it must be wrong to directly 01 the backpack, because the question is subject to some restrictions, you need to sort by Q-P from small to general items, as to why is it unclear? View code # Include # Include

Problem description gives you n vertices, M undirected edges, and each edge has a length of D and a cost of P, giving you the starting point S endpoint t, it is required to output the shortest distance from the start point to the end point and its

Question: Fill in 1 ~ in the graph given in the question ~ 8. Eight digits. The connected vertex cannot contain consecutive digits. Analysis: various restrictions, direct DFS View code # Include # Include # Include Using Namespace STD;

/* Question: analog output digital clock analysis: first, the answer is only a space, then enumerate every number, and modify the corresponding answer array. In this case, you only need to make the number 8, other functions can be

/* Question: Given the coordinates of N rectangles, calculate the covering area analysis of all rectangles: discretization. For details, see matrix67. Http://www.matrix67.com/blog/archives/108 */ # Include # Include # Include # Include Using

Sequence One Time Limit: 6000/2000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 294 accepted submission (s): 97 Problem descriptionsearch Is important in the ACM algorithm. When you want to solve a problem Using

The hdu3033 question must be different from the ordinary combination backpack (one or more in each group). In this question, at least one in each group is selected, So how can we ensure that at least one of each group is selected? The problem is

Question: give some vertices, have values, and give some edges. Then, remove an edge and divide it into two connected parts. The difference between the two parts is the smallest. Analysis: first, find all the connected components, scale down the

I would like to provide a link, tyvjp1039 loyal 2, please find it by yourself. This problem is obviously an extreme value of the interval and is dynamic, so RMQ cannot be used. A line segment tree is a good choice. In addition, I found a problem. I