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: 18

 

题意:求n个数分成m个集合 要求花费的最小值

思路:我们首先要求出状态转移方程dp[i][j]=min(dp[i][j],dp[k][j-1]+(a[i]-a[k+1])^2) 这里我们可以用四边形不等式优化（打表可知）

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#define ll long long int
using namespace std;
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int moth[]={,,,,,,,,,,,,};
int dir[][]={, ,, ,-, ,,-};
int dirs[][]={, ,, ,-, ,,-, -,- ,-, ,,- ,,};
const int inf=0x3f3f3f3f;
const ll mod=1e9+;
int dp[][]; //dp[i][j] 表示前i个人 分组成j组
int s[][]; //决策数组
int a[];
int main(){
    ios::sync_with_stdio(false);
    int t;
    cin>>t;
    int w=;
    while(t--){
        int n,m;
        cin>>n>>m;
        for(int i=;i<=n;i++){
            cin>>a[i];
        }
        sort(a+,a++n); //排序后满足一个区间内的值是首尾的差平方
        for(int i=;i<=n;i++){ //初始化边界
            dp[i][]=(a[i]-a[])*(a[i]-a[]); //前i个人分成1组
            s[i][]=; //初始化决策数组的左边界
        }
        for(int j=;j<=m;j++){
            s[n+][j]=n-; //初始化决策数组的右边界
            for(int i=n;i>=j;i--){
                dp[i][j]=inf;
                for(int k=s[i][j-];k<=s[i+][j];k++){ //四边形不等式优化
                    if(dp[i][j]>dp[k][j-]+(a[i]-a[k+])*(a[i]-a[k+])){
                        dp[i][j]=dp[k][j-]+(a[i]-a[k+])*(a[i]-a[k+]);
                        s[i][j]=k;
                    }
                }
            }
        }
        cout<<"Case "<<++w<<": ";
        cout<<dp[n][m]<<endl;
    }
    return ;
}