SDUT- 3345 数据结构实验之二叉树六：哈夫曼编码

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int a[10005], p;
char data[10005];
int vis[10005];
void sort(int l, int r)
{
    int i, j;
    for(i = r - 1; i >= l; i--)
    {
        for(j = l; j < i; j++)
        {
            if(a[j] > a[j + 1])
            {
                int t = a[j];
                a[j] = a[j + 1];
                a[j + 1] = t;
            }
        }
    }
}
int main()
{
    while(scanf("%s", data) != EOF)
    {
        getchar();
        int len = strlen(data), ans1, ans2 = 0;
        ans1 = len * 8;
        p = 0;
        memset(vis, 0, sizeof(vis));
        for(int i = 0; i < len; i++)
        {
            if(vis[i] == 1)continue;
            int sum = 0;
            for(int j = 0; j < len; j++)
            {
                if(vis[j] == 0 && data[i] == data[j])
                {
                    vis[j] = 1;
                    sum++;
                }
            }
            a[p++] = sum;
        }
        sort(0, p);
        while(p >= 2)
        {
            int x = a[0], y = a[1];
            a[0] = x + y;
            ans2 += a[0];
            a[1] = 0x3f3f3f;
            sort(0, p);
            p--;
        }
        printf("%d %d %.1lf\n", ans1, ans2, (double)ans1 / (double)ans2);
    }
    return 0;
}