动态规划基础.pdfVIP

动态规划基础 2011级ACM班 潘哲逸 动态规划 •  一般想法：有序化 •  序列类的dp •  树形dp、图上dp •  统计类dp •  状态压缩dp •  Dp优化 –  状态优化 –  转移优化 序列上的dp •  POJ 1141 （作业） –  Let us define a regular brackets sequence in the following way: –  1. Empty sequence is a regular sequence. –  2. If S is a regular sequence, then (S) and [S] are both regular sequences. –  3. If A and B are regular sequences, then AB is a regular sequence. –  For example, all of the following sequences of characters are regular brackets sequences: –  (), [], (()), ([]), ()[], ()[()] –  Write to the output file a single line that contains some regular brackets sequence that has the minimal possible length and contains the given sequence as a subsequence. 序列上的dp •  POJ 1160 （作业） –  There is a straight highway with villages alongside the highway. The highway is represented as an integer axis, and the position of each village is identified with a single integer coordinate. There are no two villages in the same position. The distance between two positions is the absolute value of the difference of their integer coordinates. –  Post offices will be built in some, but not necessarily all of the villages. A village and the post office in it have the same position. For building the post offices, their positions should be chosen so that the total sum of all distances between each village and its nearest post office is minimum. –  You are to write a program which, given the positions of the villages and the number of post offices, computes the least possible sum of all distances between each village and its nearest post office. 序列上的dp •  POJ 3017 （作业） –  Given an integer sequence { a } of length N, you are to cut