HDU 1298 T9(手机输入法相关，字典树+dfs)
题目：
Problem Description
A while ago it was quite cumbersome to create a message for the Short Message Service (SMS) on a mobile phone. This was because you only have nine keys and the alphabet has more than nine letters, so most characters could only be entered by pressing one key several times. For example, if you wanted to type "hello" you had to press key 4 twice, key 3 twice, key 5 three times, again key 5 three times, and finally key 6 three times. This procedure is very tedious and keeps many people from using the Short Message Service.
This led manufacturers of mobile phones to try and find an easier way to enter text on a mobile phone. The solution they developed is called T9 text input. The "9" in the name means that you can enter almost arbitrary words with just nine keys and without pressing them more than once per character. The idea of the solution is that you simply start typing the keys without repetition, and the software uses a built-in dictionary to look for the "most probable" word matching the input. For example, to enter "hello" you simply press keys 4, 3, 5, 5, and 6 once. Of course, this could also be the input for the word "gdjjm", but since this is no sensible English word, it can safely be ignored. By ruling out all other "improbable" solutions and only taking proper English words into account, this method can speed up writing of short messages considerably. Of course, if the word is not in the dictionary (like a name) then it has to be typed in manually using key repetition again.
Figure 8: The Number-keys of a mobile phone.
More precisely, with every character typed, the phone will show the most probable combination of characters it has found up to that point. Let us assume that the phone knows about the words "idea" and "hello", with "idea" occurring more often. Pressing the keys 4, 3, 5, 5, and 6, one after the other, the phone offers you "i", "id", then switches to "hel", "hell", and finally shows "hello".
Write an implementation of the T9 text input which offers the most probable character combination after every keystroke. The probability of a character combination is defined to be the sum of the probabilities of all words in the dictionary that begin with this character combination. For example, if the dictionary contains three words "hell", "hello", and "hellfire", the probability of the character combination "hell" is the sum of the probabilities of these words. If some combinations have the same probability, your program is to select the first one in alphabetic order. The user should also be able to type the beginning of words. For example, if the word "hello" is in the dictionary, the user can also enter the word "he" by pressing the keys 4 and 3 even if this word is not listed in the dictionary.
Input
The first line contains the number of scenarios.
Each scenario begins with a line containing the number w of distinct words in the dictionary (0<=w<=1000). These words are given in the next w lines. (They are not guaranteed in ascending alphabetic order, although it's a dictionary.) Every line starts with the word which is a sequence of lowercase letters from the alphabet without whitespace, followed by a space and an integer p, 1<=p<=100, representing the probability of that word. No word will contain more than 100 letters.
Following the dictionary, there is a line containing a single integer m. Next follow m lines, each consisting of a sequence of at most 100 decimal digits 2-9, followed by a single 1 meaning "next word".
Output
The output for each scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1.
For every number sequence s of the scenario, print one line for every keystroke stored in s, except for the 1 at the end. In this line, print the most probable word prefix defined by the probabilities in the dictionary and the T9 selection rules explained above. Whenever none of the words in the dictionary match the given number sequence, print "MANUALLY" instead of a prefix.
Terminate the output for every number sequence with a blank line, and print an additional blank line at the end of every scenario.
Sample Input
2
5
hell 3
hello 4
idea 8
next 8
super 3
2
435561
43321
7
another 5
contest 6
follow 3
give 13
integer 6
new 14
program 4
5
77647261
6391
4681
26684371
77771
Sample Output
Scenario #1:
i
id
hel
hell
hello
i
id
ide
idea
Scenario #2:
p
pr
pro
prog
progr
progra
program
n
ne
new
g
in
int
c
co
con
cont
anoth
anothe
another
p
pr
MANUALLY
MANUALLY
题目大意：
在以前，手机输入法很麻烦，因为只有9个键，而字母有26个，所以一个键上同时包含这几个字母，这样的话，为了打出一个字母可能要按几次。比如键5有“JKL”， 如果要输入K，那么就要连按两次。
这样的输入法很麻烦。所以一家公司发明了T9技术输入法。这种输入法内置这很多英语单词，它可以根据英语出现的频率，是否存在等信息，每个字母只要按一次，就可以有想要的预选单词。
例如，假设输入法只内置了一个单词“hell”， 那么只需要按4355便可以出来。
注意，如果有一个单词hell， 那么这个单词的所有前缀，h, he, hel, 也当作是存在的。
分析与总结：
这题貌似和实际应用关系还是挺大。
按照要求建好字典树，插入一个单词时，一路下去都要加上频率p.
然后就是要用dfs，求出频率最大的那个单词输出。
做这题时，没想到竟然1A了，笑死
代码：
[cpp]
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int KIND = 26;
const int MAXN = 15000;
int cnt_node;
vector<int>g[10];
char input[105];
char ans[105];
int num, Max;
bool flag;
struct node{
int prefix;
node *next[KIND];
void init(){
prefix=0;
memset(next, 0, sizeof(next));
}
}Heap[MAXN];
inline node* newNode(){
Heap[cnt_node].init();
return &Heap[cnt_node++];
}
void insert(node *root, char *str, int n){
for(char *p=str; *p; ++p){
int ch=*p-'a';
if(root->next[ch]==NULL)
root->next[ch] = newNode();
root = root->next[ch];
root->prefix += n;
}
}
void dfs(node *root, char *str, int pos){ //str保存输出结果
if(root==NULL)return;
if(pos >= num){
if(r
补充：软件开发 , C++ ,
