动态规划之四边形不等式与斜率优化.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 number of test cases. Then the description of T test cases will be given. For any test case, the first line contains two integers N (≤ 10,000) and M (≤ 5,000). N is the number of elements in S (may be duplicated). M is the number of subsets that we want to get. In the next line, there will be N integers giving set S. Output For each test case, output one line containing exactly one integer, the minimal total cost. Take a look at the sample output for format. Sample Input 2 3 2 1 2 4 4 2 4 7 10 1 Sample Output Case 1: 1 Case 2: 1 分析： dp[i][j]表示前i个数字，分成j份的最小值 dp[i][j]=min(dp[k][j-1]+w[k+1][j])(i=kj); 判断w[i][j](i和j之间的最大和最小的差的平方)是否满足 如果是，则是四边形不等式，直接套转移即可 代码： #include cstdio #include cstring #include algorithm using namespace std; #define N 10001 #define M 5001 const int INF = 0x7fffffff; inline int sqr(int x) { return x * x; } int n, m; int a[N]; int dp[N][M]; int s[N][M]; int cal() { if (n = m) return 0; sort(a + 1, a + 1 + n); for (int i = 0; i = n; ++i) for (int j = 0; j = m; ++j) dp[i][j] = -1; dp[0][0] = 0; for (int i = 1; i = n; ++i) { int maxj = min(i, m); int mn = INF, mk; for (int k = 0; k i; ++k) if (dp[k][maxj - 1] != -1) { int tmp = dp[k][maxj - 1] + sqr(a[i] - a[k + 1]); if (tmp mn) { mn = tmp; mk = k; }