动态规之四边形不等式和斜率优化.docVIP

1四边形不等式优化 对于转移 如果满足： 存在s[i][j]的转移： 最后转移： 1.1例题：hdu 3480 划分问题 Division Problem Description Little D is really interested in the theorem of sets recently. There’s a problem that confused him a long time.??Let T be a set of integers. Let the MIN be the minimum integer in T and MAX be the maximum, then the cost of set T if defined as (MAX – MIN)^2. Now given an integer set S, we want to find out M subsets S1, S2, …, SM of S, such that and the total cost of each subset is minimal. Input The input contains multiple test cases.In the first line of the input there’s an integer T which is the numb