POJ 2418 Hardwood Species (二叉搜索树/map)

Hardwood Species

Time Limit: 10000MS		Memory Limit: 65536K
Total Submissions:25606		Accepted: 9831

Description

Hardwoods are the botanical group of trees that have broad leaves, produce a fruit or nut, and generally go dormant in the winter. 
America's temperate climates produce forests with hundreds of hardwood species -- trees that share certain biological characteristics. Although oak, maple and cherry all are types of hardwood trees, for example, they are different species. Together, all the hardwood species represent 40 percent of the trees in the United States. 

On the other hand, softwoods, or conifers, from the Latin word meaning "cone-bearing," have needles. Widely available US softwoods include cedar, fir, hemlock, pine, redwood, spruce and cypress. In a home, the softwoods are used primarily as structural lumber such as 2x4s and 2x6s, with some limited decorative applications. 

Using satellite imaging technology, the Department of Natural Resources has compiled an inventory of every tree standing on a particular day. You are to compute the total fraction of the tree population represented by each species.

Input

Input to your program consists of a list of the species of every tree observed by the satellite; one tree per line. No species name exceeds 30 characters. There are no more than 10,000 species and no more than 1,000,000 trees.

Output

Print the name of each species represented in the population, in alphabetical order, followed by the percentage of the population it represents, to 4 decimal places.

双指针介绍： 

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
    char name[31];
    struct node * lchild, * rchild;
    int count;
}tree;
struct node * root;
int n  = 0;
///中序遍历

void mid_cal(struct node * root){
    if(root != NULL){
        mid_cal(root->lchild);
        printf("%s %.4f\n",root->name,((double)(root->count)/(double)n)*100);
        mid_cal(root->rchild);
    }
}

///对节点的指针进行修改时（申请指针空间时用双指针）
void insertBST(struct node **root, char * s){
    if(* root == NULL){
        struct node *p = (struct node *)malloc(sizeof(tree));
        strcpy(p->name, s);
        p -> lchild = NULL;
        p -> rchild = NULL;
        p -> count = 1;
        *root = p;
    }else {
        if(strcmp(s,(*root)->name)==0){
            ((*root)->count)++;
            return;
        }else if(strcmp(s, (*root)->name)<0){
            insertBST(&((*root)->lchild),s);
        }
        else  insertBST(&((*root)->rchild),s);
    }
}
int main()
{
    char s[31];
    while(gets(s)){
        insertBST(&root, s);
        n++;
    }
    mid_cal(root);
    return 0;
}

map实现：

#include<iostream>
#include<cstdio>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
int main()
{
    string str;
    int n = 0;
    map<string,int>m;
    while(getline(cin,str)){
        m[str]++;
        n++;
    }
    map<string,int>::iterator it;
    for(it = m.begin(); it != m.end();it++){
        cout<<it->first<<' ';
        printf("%.4f\n",it->second/(double)n*100);
    }
}