POJ 2418 Hardwood Species

　　字典树 或者  map......

　　map  8000+ ms

　　

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <map>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>

using namespace std;

struct cmp
{
    bool operator() (pair<string,int> a, pair<string,int> b)
    {
        return a > b;
    }
};

priority_queue<int,vector< pair<string,int> >,cmp> q;

map<string,int> tree;

int main()
{


    pair<string,int> stu;

    string name;

    int count = 0;

    while(getline(cin,name) != NULL)
    {
        ++tree[name];
        ++count;
    }

    map<string,int>::iterator it = tree.begin();

    while(it != tree.end())
    {
        cout<<it->first<<' '<<setiosflags(ios::fixed)<<setprecision(4)<<(it->second*100.0/count)<<endl;
        ++it;
    }

    return 0;
}

　　

　　字典树 1100+ ms 

　　

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int max;

struct T
{
    char name[40];
    int sum,mark;
    struct T *r,*l;
};

void init(struct T *root)
{
    root->r = NULL;
    root->l = NULL;
    root->sum = 0;
    root->mark = 1;
}

void link(struct T *p,char *temp)
{
        if(p->mark)
        {
            strcpy(p->name,temp);
            p->sum++;
            p->mark = 0;
        }
        else
        {
            int    mark = strcmp(temp,p->name);
            if(!mark) p->sum++;
            else if(mark > 0)
            {
                if(p->l != NULL)
                {
                    link(p->l,temp);
                    return;
                }
                else
                {
                    struct T *t;
                    t = (struct T *)malloc(sizeof(struct T));
                    init(t);
                    p->l = t;
                    link(p->l,temp);
                    return;
                }
            }
            else if(mark < 0)
            {
                if(p->r != NULL)
                {
                    link(p->r,temp);
                    return;
                }
                else
                {
                    struct T *t;
                    t = (struct T *)malloc(sizeof(struct T));
                    init(t);
                    p->r = t;
                    link(p->r,temp);
                    return;
                }
            }
        }
}

void output(struct T *root)
{
    if(root->r != NULL)
    {
        output(root->r);
        printf("%s %.4lf\n",root->name,100.0*root->sum/max);
    }
    else printf("%s %.4lf\n",root->name,100.0*root->sum/max);
    if(root->l != NULL)
    {
        output(root->l);
    }
}

int main()
{
    struct T *root;
    root = (struct T *)malloc(sizeof(struct T));
    init(root);
    char temp[40];
    max = 0;
    while(gets(temp) != NULL)
    {
        max++;
        link(root,temp);
    }
    output(root);
    return 0 ;
}