霍夫曼树的应用

霍夫曼树的具体证明在离散数学书上有，我总结大意如下：

我们平常查询单词的时候，总会有一些词查询的频率高，一些词查询的频率低，如果建立一棵树来查询，应该使那些经常查询的码（信息经过无损压缩后）的深度尽量小，这样，既省时间，又省空间。同样的前缀码会有不同的树权，树权最小的树就称为最优树，所以，对于英文字母的最佳编码问题就是求最优树 的问题。霍夫曼树每次贪心取最小的两片叶子，让他们成为兄弟，并成一棵树，权值相加并成新的一个节点，最后所有的节点合成一棵树，即为最优树。

以一道题目为例：

Entropy

Time Limit:1000MS  Memory Limit:65536K
Total Submit:23 Accepted:13

Description

An entropy encoder is a data encoding method that achieves lossless data compression by encoding a message with “wasted” or “extra” information removed. In other words, entropy encoding removes information that was not necessary in the first place to accurately encode the message. A high degree of entropy implies a message with a great deal of wasted information; english text encoded in ASCII is an example of a message type that has very high entropy. Already compressed messages, such as JPEG graphics or ZIP archives, have very little entropy and do not benefit from further attempts at entropy encoding. 

English text encoded in ASCII has a high degree of entropy because all characters are encoded using the same number of bits, eight. It is a known fact that the letters E, L, N, R, S and T occur at a considerably higher frequency than do most other letters in english text. If a way could be found to encode just these letters with four bits, then the new encoding would be smaller, would contain all the original information, and would have less entropy. ASCII uses a fixed number of bits for a reason, however: it’s easy, since one is always dealing with a fixed number of bits to represent each possible glyph or character. How would an encoding scheme that used four bits for the above letters be able to distinguish between the four-bit codes and eight-bit codes? This seemingly difficult problem is solved using what is known as a “prefix-free variable-length” encoding. 

In such an encoding, any number of bits can be used to represent any glyph, and glyphs not present in the message are simply not encoded. However, in order to be able to recover the information, no bit pattern that encodes a glyph is allowed to be the prefix of any other encoding bit pattern. This allows the encoded bitstream to be read bit by bit, and whenever a set of bits is encountered that represents a glyph, that glyph can be decoded. If the prefix-free constraint was not enforced, then such a decoding would be impossible. 

Consider the text “AAAAABCD”. Using ASCII, encoding this would require 64 bits. If, instead, we encode “A” with the bit pattern “00”, “B” with “01”, “C” with “10”, and “D” with “11” then we can encode this text in only 16 bits; the resulting bit pattern would be “0000000000011011”. This is still a fixed-length encoding, however; we’re using two bits per glyph instead of eight. Since the glyph “A” occurs with greater frequency, could we do better by encoding it with fewer bits? In fact we can, but in order to maintain a prefix-free encoding, some of the other bit patterns will become longer than two bits. An optimal encoding is to encode “A” with “0”, “B” with “10”, “C” with “110”, and “D” with “111”. (This is clearly not the only optimal encoding, as it is obvious that the encodings for B, C and D could be interchanged freely for any given encoding without increasing the size of the final encoded message.) Using this encoding, the message encodes in only 13 bits to “0000010110111”, a compression ratio of 4.9 to 1 (that is, each bit in the final encoded message represents as much information as did 4.9 bits in the original encoding). Read through this bit pattern from left to right and you’ll see that the prefix-free encoding makes it simple to decode this into the original text even though the codes have varying bit lengths. 

As a second example, consider the text “THE CAT IN THE HAT”. In this text, the letter “T” and the space character both occur with the highest frequency, so they will clearly have the shortest encoding bit patterns in an optimal encoding. The letters “C”, “I’ and “N” only occur once, however, so they will have the longest codes. 

There are many possible sets of prefix-free variable-length bit patterns that would yield the optimal encoding, that is, that would allow the text to be encoded in the fewest number of bits. One such optimal encoding is to encode spaces with “00”, “A” with “100”, “C” with “1110”, “E” with “1111”, “H” with “110”, “I” with “1010”, “N” with “1011” and “T” with “01”. The optimal encoding therefore requires only 51 bits compared to the 144 that would be necessary to encode the message with 8-bit ASCII encoding, a compression ratio of 2.8 to 1. 

Input

The input file will contain a list of text strings, one per line. The text strings will consist only of uppercase alphanumeric characters and underscores (which are used in place of spaces). The end of the input will be signalled by a line containing only the word “END” as the text string. This line should not be processed. 

Output

For each text string in the input, output the length in bits of the 8-bit ASCII encoding, the length in bits of an optimal prefix-free variable-length encoding, and the compression ratio accurate to one decimal point. 

Sample Input

AAAAABCD
THE_CAT_IN_THE_HAT
END

Sample Output

64 13 4.9
144 51 2.8 

直接代码，应该能看懂，感觉霍夫曼树挺实用的，但ACM好像不太用

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
using namespace std;
struct {
    int lc,rc,fa;
}tree[64];
string str;
int fre[60];
int best;
void huffman(int n,int dep)
{
    if(fre[n]==0) return ;
    if(n<=26) best+=fre[n]*dep;
    else 
    {
        huffman(tree[n].lc,++dep);
        huffman(tree[n].rc,dep);
    }
}
int main()
{
    int i,j,left,right;
    while(cin>>str)
    {
        if(str=="END") break;
        int len=str.length();
        for(i=0;i<=60;i++)
            tree[i].fa=-1;
        memset(fre,0,sizeof(fre));
        for(i=0;i<len;i++)
        {
            if(str[i]=='_') fre[26]++;
            else fre[str[i]-'A']++;
        }
        int node=26;
        while(1)
        {
            int min=1000;
            for(j=0;j<=node;j++)
            {
                if(tree[j].fa==-1)
                {
                    if(min>fre[j]&&fre[j])
                    {
                        min=fre[j];
                        left=j;
                    }
                    
                }
            }
            min=1000;
            for(i=0;i<=node;i++)
            {
                if(tree[i].fa==-1)
                {
                    if(min>fre[i] && i!=left && fre[i])
                    {
                        min=fre[i];
                        right=i;
                    }
                }
            }
            if(min==1000) break;
            fre[++node]=fre[left]+fre[right];
            tree[node].lc=left;
            tree[node].rc=right;
            tree[node].fa=-1;
            tree[left].fa=node;
            tree[right].fa=node;
        }
        best=0;
        if(node==26) best=len;
        else huffman(node,0);
        len*=8;
        printf("%d %d %.1f\n",len,best,len*1.0/best);
    }
    return 0;
}