Fence repair-CSDN博客

description

Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into the N planks (i.e., whose length is the sum of the lengths Li). FJ is ignoring the "kerf", the extra length lost to sawdust when a sawcut is made; you should ignore it, too.

FJ sadly realizes that he doesn't own a saw with which to cut the wood, so he mosies over to Farmer Don's Farm with this long board and politely asks if he may borrow a saw.

Farmer Don, a closet capitalist, doesn't lend FJ a saw but instead offers to charge Farmer John for each of the N-1 cuts in the plank. The charge to cut a piece of wood is exactly equal to its length. Cutting a plank of length 21 costs 21 cents.

Farmer Don then lets Farmer John decide the order and locations to cut the plank. Help Farmer John determine the minimum amount of money he can spend to create the N planks. FJ knows that he can cut the board in various different orders which will result in different charges since the resulting intermediate planks are of different lengths.

Input

Line 1: One integer N, the number of planks 
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output

Line 1: One integer: the minimum amount of money he must spend to make N-1 cuts
Sample Input

3
8
5
8
Sample Output

34
Hint

He wants to cut a board of length 21 into pieces of lengths 8, 5, and 8. 
The original board measures 8+5+8=21. The first cut will cost 21, and should be used to cut the board into pieces measuring 13 and 8. The second cut will cost 13, and should be used to cut the 13 into 8 and 5. This would cost 21+13=34. If the 21 was cut into 16 and 5 instead,the second cut would cost 16 for a total of 37 (which is more than 34).

程序一（huffman 编码的应用）： mii1存放的是最短板， mii2存放的是次短板，每一次进行合并之后的新的长度存放在mii1，即覆盖掉了最短板， mii2指向的次短板的位置会被L[N - 1]的位置覆的值盖掉。接下来，进入下一轮的合并，直至计算到的木板为1块为止。

复杂度O（n^2）

#include <cstdio>

#include <climits>
#include <algorithm>

using namespace std;

class Program {
	typedef long long ll;
	static const int MAX_N = 10000;

	int N=3, L[MAX_N]={8, 5, 8};

public:
	void solve() {
		ll ans = 0;
		while (N>1) {
			int mii1 = 0, mii2 = 1;
			if (L[mii1]>L[mii2]) swap(mii1, mii2);
			for (int i=2; i<N; ++i) {
				if (L[i]<L[mii1]) {
					mii2 = mii1;
					mii1 = i;
				} else if (L[i]<L[mii2]) {
					mii2 = i;
				}
			}
			int t = L[mii1]+L[mii2];
			ans += t;
			if (mii1 == N-1) swap(mii1, mii2);  // 保证mii1指向最后一个
			L[mii1] = t;   // 合并后的和覆盖掉L[mii1]
			L[mii2] = L[N-1]; // 用最后一个去覆盖掉次小的
			N--;  // 开始进入下一轮的合并
		}
		printf("result = %I64d\n", ans);
	}
};


int main() {
	Program P;
	P.solve();
    return 0;
}

// 采用优先队列高效实现， 时间复杂度 O（n log n）， 注意priority queue是通过heap 实现的

<include <cstdio>
#include <queue>
#include <vector>
#include <functional>

using namespace std;

class Program {
        typedef long long ll;
        static const int MAX_N = 100;
        int N = 3, L[MAX_N] = {8, 5, 8};
    public:
        void solve() {
            ll ans = 0;

            //声明一个从小到达取出数值的优先队列
            priority_queue<int, vector<int>, greater<int>> que;
            for (int i = 0; i < N; i++) {
                que.push(L[i]);
            }
            //循环到只剩下一块木板为止
            while (que.size() > 1) {
                int l1, l2;
                l1 = que.top();
                que.pop();
                l2 = que.top();
                que.pop();

                ans += l1 + l2;
                que.push(l1 + l2);
            }
            printf("%I64d", ans);
        }
};

int main() {
    Program p;
    p.solve();
    
    return 0;
}

运行结果如下：