nike0good |Oier&ACMer | 熟能生巧

MZL's munhaff function Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 230    Accepted Submission(s): 133 Problem Description MZL is

当遇到k叉哈夫曼树编码时， 应该先考虑答案是否满k个 答案是否是k-1的倍数（不足补权重为0的点） 每次选权重最小的k个，编码，扔入原始集合#include<bits/stdc++.h> using namespace std; #define For(i,n) for(int i=1;i<=n;i++) #define Fork(i,k,n) for(int i=k;i<=n;i++) #