HDU-3045 Picnic Cows

It’s summer vocation now. After tedious milking, cows are tired and wish to take a holiday. So Farmer Carolina considers having a picnic beside the river. But there is a problem, not all the cows consider it’s a good idea! Some cows like to swim in West Lake, some prefer to have a dinner in Shangri-la ,and others want to do something different. But in order to manage expediently, Carolina coerces all cows to have a picnic!
Farmer Carolina takes her N (1<N≤400000) cows to the destination, but she finds every cow’s degree of interest in this activity is so different that they all loss their interests. So she has to group them to different teams to make sure that every cow can go to a satisfied team. Considering about the security, she demands that there must be no less than T(1<T≤N)cows in every team. As every cow has its own interest degree of this picnic, we measure this interest degree’s unit as “Moo~”. Cows in the same team should reduce their Moo~ to the one who has the lowest Moo~ in this team——It’s not a democratical action! So Carolina wishes to minimize the TOTAL reduced Moo~s and groups N cows into several teams.
For example, Carolina has 7 cows to picnic and their Moo~ are ‘8 5 6 2 1 7 6’ and at least 3 cows in every team. So the best solution is that cow No.2,4,5 in a team (reduce (2-1)+(5-1) Moo~)and cow No.1,3,6,7 in a team (reduce ((7-6)+(8-6)) Moo~),the answer is 8.

Input
The input contains multiple cases.
For each test case, the first line has two integer N, T indicates the number of cows and amount of Safe-base line. Following n numbers, describe the Moo~ of N cows , 1st is cow 1 , 2nd is cow 2, and so on.

Output
One line for each test case, containing one integer means the minimum of the TOTAL reduced Moo~s to group N cows to several teams.

Sample Input
7 3
8 5 6 2 1 7 6

Sample Output
8

/*HDU-3045 斜率DP先排序再确定状态转移方程dp[i]=dp[j]+sum[i]-sum[j]-a[j+1]*(i-j); 
*/
#include<bits/stdc++.h> 
using namespace std;
#define maxn 400010
typedef long long ll;
ll n,k,que[maxn],dp[maxn],a[maxn],sum[maxn];
ll getUp(int i, int j){return dp[i]+1LL*i*a[i+1]-sum[i]-(dp[j]+1LL*j*a[j+1]-sum[j]);
}
ll getDown(int i,int j){return a[i+1]-a[j+1];
}
int main(){while(scanf("%d%d",&n,&k)==2){sum[0]=0;for(int i=1;i<=n;i++) cin>>a[i];sort(a+1,a+1+n);for(int i=1;i<=n;i++) sum[i]=sum[i-1]+a[i];dp[0]=0;//预处理前2*k-1块,如果n<2*k,那么最优就是把所有数归为一组 for(int i=1;i<k*2 && i<=n;i++) dp[i]=sum[i]-1LL*i*a[1]; int head=0,tail=0;que[tail++]=0; que[tail++]=k;for(int i=2*k;i<=n;i++){while(head+1<tail && getUp(que[head+1],que[head])<=1LL*i*getDown(que[head+1],que[head])) head++;int j=que[head];dp[i]=dp[j]+sum[i]-sum[j]-a[j+1]*(i-j);while(head+1<tail && getUp(i-k+1,que[tail-1])*getDown(que[tail-1],que[tail-2])<=getUp(que[tail-1],que[tail-2])*getDown(i-k+1,que[tail-1])) tail--;que[tail++]=i-k+1; //拉开k的差距 }printf("%lld\n",dp[n]);}return 0;
}