斜率优化DP。

。。。

对数组排序后。dp【i】【j】表示对前j个物品分i段的最少代价，dp【i】【j】= min｛ dp【i－1】【k】+（a【k+1】－a【j】）^2 }复杂度m*n^2 斜率优化一下就能够了。

Division

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 999999/400000 K (Java/Others)
Total Submission(s): 3008 Accepted Submission(s): 1173

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

Hint

The answer will fit into a 32-bit signed integer.

Source

2010 ACM-ICPC Multi-University Training Contest（5）——Host by BJTU

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>using namespace std;const int maxn=11000;int n,m;
int dp[maxn/2][maxn],a[maxn];
int q[maxn],head,tail;int main()
{int T_T,cas=1;scanf("%d",&T_T);while(T_T--){scanf("%d%d",&n,&m);for(int i=1;i<=n;i++)scanf("%d",a+i);sort(a+1,a+n+1);for(int i=1;i<=n;i++)dp[1][i]=(a[i]-a[1])*(a[i]-a[1]);for(int i=2;i<=m;i++){head=tail=0;q[tail++]=i-1;for(int j=i;j<=n;j++){while(head+1<tail){int p1=q[head];int p2=q[head+1];int x1=a[p1+1],x2=a[p2+1];int y1=dp[i-1][p1]+x1*x1;int y2=dp[i-1][p2]+x2*x2;if((y2-y1)<=(x2-x1)*2*a[j]) head++;else break;}int k=q[head];dp[i][j]=dp[i-1][k]+(a[k+1]-a[j])*(a[k+1]-a[j]);while(head+1<tail){int p1=q[tail-2],p2=q[tail-1],p3=j;int x1=a[p1+1],x2=a[p2+1],x3=a[p3+1];int y1=dp[i-1][p1]+x1*x1;int y2=dp[i-1][p2]+x2*x2;int y3=dp[i-1][p3]+x3*x3;if((y3-y2)*(x2-x1)<=(y2-y1)*(x3-x2)) tail--;else break;}q[tail++]=j;}}printf("Case %d: %d\n",cas++,dp[m][n]);}return 0;
}

转载于:https://www.cnblogs.com/mengfanrong/p/5066344.html

HDOJ 3480 Division相关推荐

java 判断中文字符_java中判断字符串中是否有中文字符
package com.meritit.test; public class TestChart { public static void main(String[] args) throws Exc ...
kuangbin带你飞专题合集
题目列表 [kuangbin带你飞]专题一简单搜索 [kuangbin带你飞]专题二搜索进阶 [kuangbin带你飞]专题三 Dancing Links [kuangbin带你飞]专题四最短路 ...
无法打开此程序因为计算机丢失,解决X-Scan安装后“无法启动此程序，因为计算机丢失NPPTools.dll”...
配置CENTOS YUM更新源众所周知,Centos 有个很方便的软件安装工具 yum,但是默认安装完centos,系统里使用的是国外的centos更新源,这就造成了我们使用默认更新源安装或者更新 ...
动态规划总结与题目分类
源博客链接:http://blog.csdn.net/cc_again/article/details/25866971 动态规划一直是ACM竞赛中的重点,同时又是难点,因为该算法时间效率高,代码量少 ...
dp进阶之FFT加速+数据结构优化+不等式优化
快速傅里叶变换快速傅里叶变换(英语:Fast Fourier Transform, FFT),是快速计算序列的离散傅里叶变换(DFT)或其逆变换的方法.傅里叶分析将信号从原始域(通常是时间或空间)转 ...
算法学习经典例题整理
陆续会对本篇博客进行更新! 搜索:https://vjudge.net/contest/292597 区间DP:https://vjudge.net/contest/293892 树状背包:https ...
（转）dp动态规划分类详解
dp动态规划分类详解转自:http://blog.csdn.NET/cc_again/article/details/25866971 动态规划一直是ACM竞赛中的重点,同时又是难点,因为该算法时间 ...
《动态规划》— 动态规划分类
动态规划(英语:Dynamic programming,DP)是一种在数学.计算机科学和经济学中使用的,通过把原问题分解为相对简单的子问题的方式求解复杂问题的方法. 动态规划常常适用于有重叠子问题和最 ...
转：动态规划题目分类
https://blog.csdn.net/cc_again/article/details/25866971 一.简单基础dp 这类dp主要是一些状态比较容易表示,转移方程比较好想,问题比较基本常见 ...

HDOJ 3480 Division

Division

HDOJ 3480 Division相关推荐

最新文章

热门文章