树-堆结构练习——合并果子之哈夫曼树
Time Limit: 1000MS
Memory Limit: 65536KB
Problem Description
在一个果园里,多多已经将所有的果子打了下来,而且按果子的不同种类分成了不同的堆。多多决定把所有的果子合成一堆。
每一次合并,多多可以把两堆果子合并到一起,消耗的体力等于两堆果子的重量之和。可以看出,所有的果子经过n-1次合并之后,就只剩下一堆了。多多在合并果子时总共消耗的体力等于每次合并所消耗体力之和。
因为还要花大力气把这些果子搬回家,所以多多在合并果子时要尽可能地节省体力。假定每个果子重量都为1,并且已知果子的种类数和每种果子的数目,你的任务是设计出合并的次序方案,使多多耗费的体力最少,并输出这个最小的体力耗费值。
例如有3种果子,数目依次为1,2,9。可以先将1、2堆合并,新堆数目为3,耗费体力为3。接着,将新堆与原先的第三堆合并,又得到新的堆,数目为12,耗费体力为12。所以多多总共耗费体力=3+12=15。可以证明15为最小的体力耗费值。
Input
第一行是一个整数n(1<=n<=10000),表示果子的种类数。第二行包含n个整数,用空格分隔,第i个ai(1<=ai<=20000)是第i个果子的数目。
Output
输出包括一行,这一行只包含一个整数,也就是最小的体力耗费值。输入数据保证这个值小于2^31。
Example Input
3 1 2 9
Example Output
15
Hint
Author
赵利强
哈夫曼做法(还可用动规和堆做)
#include <stdio.h>
int a[100010];
void HeapAdjust(int low,int hight)//建堆
{
int i;
int t = a[low];
for(i = 2*low;i <= hight;i*=2)
{
if(i<hight&&a[i+1]<a[i])
i++;
if(t > a[i])
{
a[low] = a[i];
a[i] = t;
}
else
break;
low = i;
}
}
int shan(int low,int hight)//删除low为删除序号hight为堆元素个数
{
int t,i;
t = a[low];
a[low] = a[hight];
a[hight] = t;
t = a[low];
for(i = 2*low;i <= hight-1;i*=2)
{
if(i<hight-1&&a[i+1]<a[i])
i++;
if(t > a[i])
{
a[low] = a[i];
a[i] = t;
}
else
break;
low = i;
}
return hight-1;
}
int jia(int num,int hight)//添加元素,num为添加数大小,hight为堆元素个数
{
int i;
a[hight+1] = num;
for(i = (hight-1)/2;i > 0;i/=2)
{
if(num < a[i])
{
a[i] = num;
a[hight] = a[i];
}
else
break;
hight = i;
}
return hight+1;
}
int main()
{
int i,n;
scanf("%d",&n);
// {
for(i = 1;i <= n;i++)
{
scanf("%d",&a[i]);
}
for(i=n/2;i>0;i--) //建堆
HeapAdjust(i,n);
int num = 0;
int m = n;
int sum;
for(i = 0;i < m-1;i++) //计算
{
num+=a[1];
sum = a[1];
n = shan(1,n);
num+=a[1];
sum+=a[1];
n = shan(1,n);
n = jia(sum,n);
}
printf("%d\n",num);
// }
return 0;
}
哈夫曼做法(还可用动规和堆做)
#include <stdio.h> #include <stdlib.h> #define Max 30000 int a[Max]; struct node { int weight; int parent,l,r; }L[Max]; int main() { int n,m,i,j; scanf("%d",&n); m = 2*n-1; // printf("%d\n", (1<<31-1)); //建树 for(i = 1;i <= n;i++) { scanf("%d",&L[i].weight); } for(i = 1;i <= m;i++) { L[i].parent = L[i].l = L[i].r = 0; } for(i = n+1;i<=m;i++) { int p1,p2,s1,s2; p1 = p2 = 0,s1 = s2 =1e9; //权值回合并, for(j = 1;j <= i-1;j++) { if(L[j].parent == 0) { if(L[j].weight < s1) { p2 = p1; p1 = j; s2 = s1; s1 = L[j].weight; } else if(L[j].weight < s2) { s2 = L[j].weight; p2 = j; } } } L[p1].parent = i; L[p2].parent = i; L[i].l = p1; L[i].r = p2; L[i].weight = L[p1].weight + L[p2].weight; } long long int num,sum; num = sum = 0; for(i = 1;i <= n;i++) { num = 0; j = i; while(L[j].parent != 0) { num++; j = L[j].parent; } sum += L[i].weight * num; } printf("%lld\n",sum); return 0; }堆
#include <stdio.h>
int a[100010];
void HeapAdjust(int low,int hight)//建堆
{
int i;
int t = a[low];
for(i = 2*low;i <= hight;i*=2)
{
if(i<hight&&a[i+1]<a[i])
i++;
if(t > a[i])
{
a[low] = a[i];
a[i] = t;
}
else
break;
low = i;
}
}
int shan(int low,int hight)//删除low为删除序号hight为堆元素个数
{
int t,i;
t = a[low];
a[low] = a[hight];
a[hight] = t;
t = a[low];
for(i = 2*low;i <= hight-1;i*=2)
{
if(i<hight-1&&a[i+1]<a[i])
i++;
if(t > a[i])
{
a[low] = a[i];
a[i] = t;
}
else
break;
low = i;
}
return hight-1;
}
int jia(int num,int hight)//添加元素,num为添加数大小,hight为堆元素个数
{
int i;
a[hight+1] = num;
for(i = (hight-1)/2;i > 0;i/=2)
{
if(num < a[i])
{
a[i] = num;
a[hight] = a[i];
}
else
break;
hight = i;
}
return hight+1;
}
int main()
{
int i,n;
scanf("%d",&n);
// {
for(i = 1;i <= n;i++)
{
scanf("%d",&a[i]);
}
for(i=n/2;i>0;i--) //建堆
HeapAdjust(i,n);
int num = 0;
int m = n;
int sum;
for(i = 0;i < m-1;i++) //计算
{
num+=a[1];
sum = a[1];
n = shan(1,n);
num+=a[1];
sum+=a[1];
n = shan(1,n);
n = jia(sum,n);
}
printf("%d\n",num);
// }
return 0;
}