动态规划在信息学奥林匹克竞赛中的应用（Application of dynamic programming in Informatics Olympiad）.docVIP

动态规划在信息学奥林匹克竞赛中的应用（Application of dynamic programming in Informatics Olympiad） Application of dynamic programming in Informatics Olympiad I. implications for dynamic programming: In real life, a kind of activity, because of its particularity, the process can be divided into several interrelated stages, in each stage of it to make decisions, so as to make the whole process to achieve the best effect. Therefore, each stage of decision-making, a decision sequence. It also identified a route of the whole process. This put a problem as a multistep process and associated with the chain structure, called multi stage decision process, this kind of problem is called multi stage decision problems. In the multi stage decision problems in each stage to take decisions, and time is generally about the decision depends on the current state, and then cause state transfer, a decision sequence is generated in the changes of the state, the dynamic meaning, we call this process of solving multi stage optimal decision for the dynamic programming. Two. Dynamic programming characteristics The salient features of dynamic programming are: no effects, boundary conditions, and generally divided into distinct stages Generally, there is one or more state transition equations in dynamic programming Three. Examples 1. Catcher defense missile (GDOI98) The topic is very troublesome, in the final analysis, is to find the longest non ascending sequence in a series of numbers This question I started using a backtracking algorithm can get about 1/3 minutes, later found that this is the most basic dynamic programming algorithm in the title, with a two-dimensional array of C[1..Max and 1..2] to establish the dynamic programming equation of state (Note: C[1..Max 1], said the number of missiles, the current state of up down C[1..Max 2] said, the current state of the following signs): Ci=Max{C[j]+1 (j=i+1..N)}, then the program is not difficult to achieve. Demonstration program: Program catcher_hh; Var F:te