A violent
Short and long strings of string comparison, certainly not enough to back short string you want to add, and then we look at how many strings in front of two unequal needs to be changed would be finished.
B-thirds
Many of the questions we have to examine extreme value-half or one-third think about the feasibility of this problem is the range of peak-third of it is clear that the problem
like a dichotomy that is monotonous range, this question can be half its derivatives.
Blog to learn
special study
D greedy
If the flash can shorten the distance and shorter distances> 1, then we will flash, otherwise we might as well go directly past better
can look greedy algorithm tutorial 51nod: the
greedy algorithm entry
classic greedy algorithm
E Simple Game
It can be pushed in briefly when n is 2, 3, when the answer, after pushing can be converted to the foregoing known.
F Dynamic Programming
51nod above, there are tutorials dynamic programming topics, which are some of the more classic dynamic programming examples, take a look at the backpack nine stresses also recommended that
the primary DP
Advanced DP
Dynamic Programming Template
suggest that you start with a simple start to try to understand the transfer equation
G delamination BFS
Consider zombies will appear at what time in what position, (2k-2) for a period of total time T, time T, the zombies will always appear in the position from the initial position T% (2k-2), the pre-advance deal with what
was then the equivalent of obstacles, and in time t (x, y) coordinates will appear directly obstacles can determine the current bfs past
search algorithm introduced
mainly to practice, you can write about the search of the topic kuangbin
H hexadecimal conversion
The length of a string of 26 hexadecimal 6 is regarded as a digital output coupled to the result of the mod.
I really sign the title! ! !
J simulation
First side length of regular polygon can be calculated, and then we'll see in a clockwise or counter-clockwise which is more superior on the line.
