hnust_xiehonghao的专栏

Hat’s WordsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3847    Accepted Submission(s): 1456Problem DescriptionA hat’s word is a

1323: ZZY and his little friendsTime Limit: 5 Sec  Memory Limit: 256 MBSubmit: 239  Solved: 103[Submit][Status][Web Board]Description  zzy养了一只小怪兽和N只凹凸曼，单挑的话每只凹凸曼都不是小怪兽的对手，所以必须由两只凹凸曼合作来

Super MarioTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 771    Accepted Submission(s): 423Problem DescriptionMario is world-famou

1315.字符串编码Time Limit: 1000 MS         Memory Limit: 65536 KTotal Submissions: 317 (89 users)         Accepted: 100 (83 users)[ My Solution] Description在网络通信传输过程中，需要用到编码技术。由于网络只能传输0

Trees on the levelTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 192    Accepted Submission(s): 74Problem DescriptionTrees are fund

以下内容  为网上复制 及部分的个人理解   Trie树就是字典树，其核心思惟就是空间换时候。举个简单的例子。给你100000个长度不跨越10的单词。对于每一个单词，我们要断定他出没呈现过，若是呈现了，第一次呈现第几个地位。这题当然可以用hash来，然则我要介绍的是trie树。在某些方面它的用处更大。比如说对于某一个单词，我要询问它的前缀是否呈现过。如许ha

哈夫曼树之杭电2527   2012-5-23 22:09阅读(0)Safe Or UnsafeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 660    Accepted Submission(s): 220

RepositoryTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1385    Accepted Submission(s): 487Problem DescriptionWhen you go shopping

Phone ListTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4627    Accepted Submission(s): 1564 题意：   看一堆电话号码中是不是某个电话号码是其中一个电话号码的前缀 如果有

问题 I: 数据结构（C语言版）算法6.12__huffman编码时间限制: 1 Sec  内存限制: 128 MB提交: 20  解决: 12[提交][状态][讨论版]题目描述w存放n个字符的权值(权值均是大于0的正整数)，构造赫夫曼树HT，并求出n个字符的赫夫曼编码HC。其它未明示之处请参见教材P147页上的相关文字及算法描述。输入先输入权值的个数n（n

#include#include #include //左子树比右子树高一#define LH 1//左子树和右子树一样高#define EH 0//左子树比右子树低一#define RH -1#define EQ(a,b) ((a) == (b))#define LT(a,b) ((a) < (b))#define LQ(a,b)((a) <= (b))typedef