Others

Question address: http://acm.timus.ru/problem.aspx? Space = 1 & num = 1297 Give you a string and ask you to find the longest reply substring Solution: Add the reverse string of the original string to the back of the original string, and add

1, Although the training has been exposed to many unknownAlgorithmI have also used it to solve the questions assigned by teachers, but they are not very familiar with learning specific questions. DP searches are the most basic, but they are really

Question A in the evening: sleeping sweet ~ @ Albafica Daniel Before going to bed, let's see a dictionary tree: -> Question, click here There was a Martian who wrote a piece of Mars and could not understand it, but left a dictionary that

1, Communication is not enough. Generally, a person understands a question and starts to want to do it. After each question is understood, at least one teammate needs to talk about the question and decide who is better suited to the question.

The Application of Euler's loop and rotating drum. Debruijin Time Limit: 4000/2000 MS (Java/others) memory limit: 32768/32768 K (Java/Others) Total submission (s): 307 accepted submission (s): 195 Problem description the surface

A non-descending sequence composed of N numbers (this is an important condition ). There are m inquiries, and the maximum number of numbers appear between [L, R. This question only involves querying and does not involve modification. Select ST

Simple DP Sort weights by quality Only items that may be adjacent to their quality can obtain the Least Square of the Quality Difference DP [I] [J] indicates the minimum fatigue required by j pairs in the first I items DP equation: DP [I] [J]

Question address: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4259 /* Author: bob lee2012.8.27 ==================================================== first, the question there are n cards for understanding the meaning, then, if there are more

Here I will give several equal relations. 1: F is the largest stream of the capacity network G. 2: | f | equal to the minimum cut capacity of the capacity network. 3: There is no augmented path for the capacity network. 4: The residual

Address: http://www.spoj.com/problems/SUBST1/ The question meaning and solution ideas are the same as spoj694, but the scope is wider. But we useAlgorithmNo pressure, directly crushed. See: http://blog.csdn.net/dr5459/article/details/9051149

Matrix67 Daniel's blog about Matrix Multiplication. This question is a template question of the first type. Previously, I learned how to multiply the matrix continuously. The multiplication of matrices is amazing.     Time limit for point

-> Question, click here It takes at least a few steps to change from the first string to the second string. Changes in each step include: 1: Each number is + 1, 9 + 1 = 1; 2: Each number-1, 1-1 = 9; 3: A number is exchanged with its

The meaning of thinking here are clearly written → http://hi.baidu.com/chenwenwen0210/item/b4f142d53129fdc954347f11 I think this question is really amazing.ProgramIt is too important for the staff to be rigorous, conscientious, and good

Question address: http://acm.timus.ru/problem.aspx? Space = 1 & num = 1780 Question meaning: Give you a gray code binary and Gray Code itself But some of them are? Instead, ask if this result is unique. Output is unique. output is ambiguity

I wanted to strengthen my DP capability, so I found several papers in the monotonous queue and started to look at the papers for my questions. However, the first question was a tragedy. I 've been doing this for a long time, today, a finally fell.

[General idea] The TSP Problem of 10 points, but each point is required to go to both sides at most, not only once, so the problem should be solved using three-digit state compression. It can pre-process the K bit of each State. [Resolution] The

Question address: http://poj.org/problem? Id = 3892 Give you a number N and a K Where N can be decomposed by two prime numbers p and q. A condition is added: | Q-KP | 5 Ask for p and q Solution: Q 5 Therefore, KP-q 5 Then kpq-Q * q Because n =

Lianliankan Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1778 accepted submission (s): 558Problem descriptioni like playing game with my friend, although sometimes looks pretty naive. Today I

Let's take a few more questions to deepen our understanding. The same is to obtain the least vertex weight overwrite, and also to obtain a minimum cut, but to cut out those sides, as long as the final remaining network can be traversed once,

Question: For a square matrix composed of 1 and 0, calculate the number of squares where all four edges are composed of 1. Method: First, count each point in the matrix in four directions, and the maximum number of consecutive 1 values. Here we use