霍夫曼编码 zoj 2339 Hyperhuffman
来源:互联网 发布:社交网络的好处知乎 编辑:程序博客网 时间:2024/05/18 01:13
You might have heard about Huffman encoding - that is the coding system that minimizes the expected length of the text if the codes for characters are required to consist of an integral number of bits.
Let us recall codes assignment process in Huffman encoding. First the Huffman tree is constructed. Let the alphabet consist of N characters, i-th of which occurs Pi times in the input text. Initially all characters are considered to be active nodes of the future tree, i-th being marked with Pi. On each step take two active nodes with smallest marks, create the new node, mark it with the sum of the considered nodes and make them the children of the new node. Then remove the two nodes that now have parent from the set of active nodes and make the new node active. This process is repeated until only one active node exists, it is made the root of the tree.
Note that the characters of the alphabet are represented by the leaves of the tree. For each leaf node the length of its code in the Huffman encoding is the length of the path from the root to the node. The code itself can be constrcuted the following way: for each internal node consider two edges from it to its children. Assign 0 to one of them and 1 to another. The code of the character is then the sequence of 0s and 1s passed on the way from the root to the leaf node representing this character.
In this problem you are asked to detect the length of the text after it being encoded with Huffman method. Since the length of the code for the character depends only on the number of occurences of this character, the text itself is not given - only the number of occurences of each character. Characters are given from most rare to most frequent.
Note that the alphabet used for the text is quite huge - it may contain up to 500 000 characters.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Input
The first line of the input file contains N - the number of different characters used in the text (2 <= N <= 500 000). The second line contains N integer numbers Pi - the number of occurences of each character (1 <= Pi <= 109, Pi <= Pi+1 for all valid i).
Output
Output the length of the text after encoding it using Huffman method, in bits.
Sample Input
1
3
1 1 4
Sample Output
8
Author: Andrew Stankevich
Source: Andrew Stankevich's Contest #2
#include<cstdio>#include<queue>#include<cstring>#include<algorithm>using namespace std;typedef long long ll;const int maxn=500005;int n;ll L[maxn];void solve(){ ll ans=0; priority_queue<ll,vector<ll>,greater<ll> >que; for(int i=1;i<=n;i++) que.push(L[i]); while(que.size()>1)//循环到只剩一块木板; { ll l1,l2; l1=que.top(); que.pop(); l2=que.top(); que.pop(); ans+=l1+l2; que.push(l1+l2); } printf("%lld\n",ans);}int main(){ int t; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%lld",&L[i]); } solve(); if(t>0) printf("\n"); }}
- 霍夫曼编码 zoj 2339 Hyperhuffman
- zoj 2339 Hyperhuffman 赫夫曼编码
- ZOJ 2339 Hyperhuffman(Huffman编码)
- ZOJ 2339 Hyperhuffman
- ZOJ 2339 Hyperhuffman
- zoj 2339 Hyperhuffman 哈夫曼编码 (4-C)
- ZOJ2339 Hyperhuffman(霍夫曼编码长度)
- sgu203:Hyperhuffman(哈夫曼编码)
- C - Hyperhuffman(哈弗曼值)
- sgu-203 Hyperhuffman
- ZOJ2339 Hyperhuffman 优先队列
- Hyperhuffman (哈夫曼树(水题))
- ZOJ 1117 Entropy(哈夫曼编码)
- zoj 2339
- 数据压缩编码:霍夫曼编码
- ZOJ
- ZOJ
- ZOJ
- Java语言
- First Bad Version
- Android Material Design Toolbar
- POJ 1325 Machine Schedule
- PMOS管学习应用
- 霍夫曼编码 zoj 2339 Hyperhuffman
- 解决mariadb数据库服务无法开启
- BeautifulSoup安装以及一些错误
- jvm运行机制
- Andriod Service与Thread的区别
- 使用 Mockito 修改私有属性
- QMUI / QMUI_iOS框架学习(五)
- 菜鸟之路
- 史上最简单的SpringCloud教程 | 第二篇: 服务消费者(rest+ribbon)