poj树（字典树、哈夫曼树）

Hardwood Species

http://poj.org/problem?id=2418
解法一：二叉搜索树

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

typedef struct BSTree{
	int count;
	struct BSTree *left,*right;
	char node[30];
}BST;

//构造二叉搜素树
void insert(BST* &root,char* st){
	if(root==NULL){
		root = new BST;
		strcpy(root->node,st);
		root->count = 1;
		root->left = NULL;
		root->right = NULL;
		return;
	}

	if(strcmp(root->node,st)==0){
		root->count++;
		return;
	}
	if(strcmp(root->node,st)>0)
		insert(root->left,st);
	else
		insert(root->right,st);	
}
//中序遍历
void midtraverse(BST* root,double total){
	if(root==NULL)
		return;
	midtraverse(root->left,total);
	cout<<root->node<<' ';
	printf("%.4lf\n",(double)root->count/total*100);
	midtraverse(root->right,total);
}
	
int main(){
	BSTree *root = NULL;
	char name[50];
	double total = 0;
	while(gets(name)){
		insert(root,name);
		total++; 
	}
	midtraverse(root,total);
	return 0;
} 

解法二：字典树
关于字典树的知识，可以参考https://blog.csdn.net/i_am_jm/article/details/89646733

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int maxn = 130;
typedef struct Tree{
	int count;
	int flag;//标记，看是不是最后一个字母
	char name[50];
	struct Tree* next[maxn];
}Tree;
Tree* create(){
	Tree* root = new Tree;
	root->count = 0;
	root->flag = 0;
	for(int i=0;i<127;i++)//必需用ASCILL码做，有空格
    {
        root->next[i]=NULL;
    }
	return root;
}
void insert(Tree* root,char name[]){
	Tree *r = root;
	int len = strlen(name);
	int n;
	for(int i = 0;i<len;i++){
		n = name[i];
		if(r->next[n]==NULL)
			r->next[n] = create();
		r = r->next[n];
	}
	r->count++;
	r->flag = 1;
	strcpy(r->name,name);
}
void dfs(Tree* root,double total){
	Tree* p = root;
	if(p->flag){
		cout<<p->name<<' ';
		printf("%.4lf\n",(double)p->count/total*100);
	}
	for(int i = 0;i<127;i++){
		if(p->next[i]!=NULL)
			dfs(p->next[i],total);
	}
}
int main(){
	char name[50];
	Tree *root = create();
	double total = 0;
	while(gets(name)){
		insert(root,name);
		total++;
	}
	dfs(root,total);
	return 0;
}

Colored Sticks

http://poj.org/problem?id=2513
知识点：并查集+欧拉通路+字典树。如果将木棒两端的颜色看成两个点，将木棒看成一条边，则题目转化为判断是否能够构成欧拉路。用字典树关键在于构造树的结构，将输入的单词变为对应的一个数字，然后并查集判断是否连通并且判断图中奇数度的个数是否小于2，大于等于3不能形成一个欧拉路。

#include <iostream>
#include <cstdio>
using namespace std;

const int N = 500005;
int degree[N];
int f[N];
int count;
struct trie{
	int id;
	trie *next[26];
	trie(){
		id = 0;
		for(int i = 0;i<26;i++){
			next[i] = NULL;
		}
	}
}*root;

void Init(){
	for(int i = 0;i<N;i++){
		degree[i] = 0;
		f[i] = i;
	}
	count = 0;
}
int getNum(char s[]){
	int i = 0;
	trie *p = root;
	while(s[i]!='\0'){
		if(p->next[s[i]-'a']==NULL) 
			p->next[s[i]-'a'] = new trie();
		p = p->next[s[i++]-'a'];
	}
	if(p->id==0){
		p->id = ++count;
	}
	return p->id;
}

int find(int v){
	if(v!=f[v]){
		f[v] = find(f[v]);	
	}
	return f[v];
}

void merge(int v,int u){
	v = find(v);
	u = find(u);
	f[v] = u;
}
int main(){
	char s1[12],s2[12];
	int num1,num2;
	
	root = new trie();
	Init();//并查集和度数数组初始化 
	while(~scanf("%s%s",s1,s2)){
		num1 = getNum(s1);
		num2 = getNum(s2);
		degree[num1]++;
		degree[num2]++;
		merge(num1,num2);
	}
	int val = 0;
	int father = find(1);//如果能连成一条直线，那么以1号节点为起始点，所有节点的祖先都是1号节点 
	for(int i = 1;i<=count;i++){
		if(degree[i]%2)
			val++;
		if(val>2||find(i)!=father){
			printf("Impossible\n");
			return 0;
		}
	} 
	printf("Possible\n");
	return 0;
} 

Fence Repair

http://poj.org/problem?id=3253
思路：哈夫曼树(知识点可以参考王卓老师的PPT）

#include <iostream>
#include <queue>
#include <cstdio>
using namespace std;

priority_queue<int,vector<int>,greater<int>>q;//小顶堆 
int main(){
	int t;
	scanf("%d",&t);
	for(int i = 0;i<t;i++){
		int num;
		scanf("%d",&num);
		q.push(num);
	}
	long long res = 0;
	while(q.size()>1){
		int s1 = q.top();
		q.pop();
		int s2 = q.top();
		q.pop();
		res += (long long)(s1+s2);
		q.push(s1+s2);
	}
	printf("%lld",res);
	return 0;
}