2014年4月10日
hdu 2527 Safe Or Unsafe (哈夫曼树)
摘要： Safe Or UnsafeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1388Accepted Submission(s): 544Problem DescriptionJavac++ 一天在看计算机的书籍的时候，看到了一个有趣的东西！每一串字符都可以被编码成一些数字来储存信息，但是不同的编码方式得到的储存空间是不一样的！并且当储存空间大于一定的值的时候是不安全的！所以Javac++ 就想是否有一种方式是可以得到字符编码最小的空间值！显然 阅读全文
posted @ 2014-04-10 22:48 heaventouch 阅读(340) 评论(0) 推荐(0) 编辑
hdu 1053 Entropy (哈夫曼树)
摘要： EntropyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3648Accepted Submission(s): 1451Problem DescriptionAn entropy encoder is a data encoding method that achieves lossless data compression by encoding a message with “wasted” or “extra” informatio 阅读全文
posted @ 2014-04-10 16:46 heaventouch 阅读(345) 评论(0) 推荐(0) 编辑
hdu 3231 Box Relations (拓扑排序)
摘要： Box RelationsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 894Accepted Submission(s): 324Special JudgeProblem DescriptionThere arenboxesC1, C2, ..., Cnin 3D space. The edges of the boxes are parallel to thex, yorz-axis. We provide some relations 阅读全文
posted @ 2014-04-10 11:44 heaventouch 阅读(334) 评论(0) 推荐(0) 编辑