农夫要修理牧场的一段栅栏,他测量了栅栏,发现需要N块木头,每块木头长度为整数Li个长度单位,于是他购买了一条很长的、能锯成N块的木头,即该木头的长度是Li的总和。
但是农夫自己没有锯子,请人锯木的酬金跟这段木头的长度成正比。为简单起见,不妨就设酬金等于所锯木头的长度。例如,要将长度为20的木头锯成长度为8、7和5的三段,第一次锯木头花费20,将木头锯成12和8;第二次锯木头花费12,将长度为12的木头锯成7和5,总花费为32。如果第一次将木头锯成15和5,则第二次锯木头花费15,总花费为35(大于32)。
请编写程序帮助农夫计算将木头锯成N块的最少花费。
输入格式:
输入首先给出正整数N(≤104),表示要将木头锯成N块。第二行给出N个正整数(≤50),表示每段木块的长度。
输出格式:
输出一个整数,即将木头锯成N块的最少花费。
输入样例:
8
4 5 1 2 1 3 1 1
输出样例:
49
代码:
#include<stdio.h>
#include<stdlib.h>
typedef struct HNode* MinHeap;
struct HNode {
int* Data;
int Size;
int Capacity;
};
MinHeap CreateHeap(int MaxSize) {
MinHeap H = (MinHeap)malloc(sizeof(struct HNode));
H->Data = (int*)malloc(sizeof(int));
H->Size = 0;
H->Capacity = MaxSize;
H->Data[0] = 0;
return H;
}
void PercDown(MinHeap H, int p) {
int Parent, Child;
int X;
X = H->Data[p];
for (Parent = p; Parent * 2 <= H->Size; Parent = Child) {
Child = Parent * 2;
if ((Child != H->Size) && (H->Data[Child] > H->Data[Child + 1]))
Child++;
if (X <= H->Data[Child])
break;
else
H->Data[Parent] = H->Data[Child];
}
H->Data[Parent] = X;
}
void BuildHeap(MinHeap H) {
int i;
for (i = H->Size / 2; i > 0; i--) {
PercDown(H, i);
}
}
int IsEmpty(MinHeap H) {
if(H->Size==0)
return 1;
else
return 0;
}
int DeleteMin(MinHeap H) {
int Parent, Child;
int MinItem, X;
if (IsEmpty(H))
return 0;
MinItem = H->Data[1];
X = H->Data[H->Size--];
for (Parent = 1; Parent * 2 <= H->Size; Parent = Child) {
Child = Parent * 2;
if ((Child != H->Size) && (H->Data[Child] > H->Data[Child + 1]))
Child++;
if (X <= H->Data[Child])
break;
else
H->Data[Parent] = H->Data[Child];
}
H->Data[Parent] = X;
return MinItem;
}
int IsFull(MinHeap H) {
if(H->Size == H->Capacity)
return 1;
else
return 0;
}
int Insert(MinHeap H, int X) {
int i;
if (IsFull(H)) {
return 0;
}
i = ++H->Size;
for (; H->Data[i / 2] > X; i /= 2) {
H->Data[i] = H->Data[i / 2];
}
H->Data[i] = X;
return 1;
}
int main() {
int N;
int X;
int result=0;
scanf("%d", &N);
MinHeap H = CreateHeap(N);
for (int i = 1; i <= N; i++) {
scanf("%d", &X);
H->Data[i] = X;
H->Size++;
}
BuildHeap(H);
while (!IsEmpty(H)) {
int X = DeleteMin(H);
if (IsEmpty(H))
break;
int Y = DeleteMin(H);
X += Y;
Insert(H, X);
result += X;
}
printf("%d", result);
return 0;
}