POJ 1521 Entropy
摘要:霍夫曼树#include<cstdio>
#include<string.h>
#include<iostream>
#include<string>
using namespace std;
#define LEFT(i) 2*i
#define RIGHT(i) 2*i+1
#define PARENT(i) i/2 int heapsize,root;
int finalcode[200]; struct Word{ int num,number; double freq;
}word[200]; struct Node{ int num,
阅读全文
posted @ 2012-04-20 22:16
浙公网安备 33010602011771号