暴搜。。。HOJ2297 Automatic Correction of Misspellings。

暴力过的。。 与限时只差0.03s。。。

Automatic Correction of Misspellings

---

Time limit:	2sec.	Submitted:	30
Memory limit:	64M	Accepted:	17

Source: Ulm 2006

---

Some text editors offer a feature to correct words which seem to be written incorrectly. In this problem you are asked to implement a simple Automatic Correction of Misspellings (ACM).

ACM takes care of the following misspellings of words:

1. One letter is missing (e.g., letter is written leter) or too much (e.g., letter is written lettter).
2. One letter is wrong (e.g., letter is written ketter)
3. The order of two adjacent letters is wrong (e.g., letter is written lettre)

ACM is based on a dictionary of known words. When a text contains a word which is not in the dictionary, ACM will try to replace it by a similar word of the dictionary. Two words are similar if we can transform one word into the other by doing exactly one of the misspellings listed above. An unknown word is left unchanged if there is no similar word in the dictionary.

Input

The first line of the input file will give the number n of words in the dictionary (n <= 10000). The next n lines contain the dictionary words. The following line contains an integer q <= 1000, the number of query words. The next q lines contain the query words. You may assume that each word in the input consists of 1 to 25 lower case letters ('a' to 'z').

Output

For each query word, print one line with the query word followed by one of the following possibilities:

1. is correct, if the word occurs in the dictionary.
2. is a misspelling of <x>, where <x> is a word of the dictionary similar to the query word, and the query word is not in the dictionary. In the case that there are several possibilities, select the word from the dictionary which appeared earlier in the input.
3. is unknown, if cases 1 and 2 do not apply.

Sample Input

10
this
is
a
dictionary
that
we
will
use
for
us
6
su
as
the
dictonary
us
willl

Sample Output

su is a misspelling of us
as is a misspelling of is
the is unknown
dictonary is a misspelling of dictionary
us is correct
willl is a misspelling of will

Runid	Proid	Subtime	Judgestatus	Runtime	Memory	Language	Code Length	Author
589564	2297	2011-06-15 16:43:53	Accepted	1.97 s	1692 K	C++	2116 B	yangchenhao8

说明：
囧。。。题意是字典找最接近的词。 包括一次相邻调换、换一个字母、多一个或少一个字母。
如果有多种 misspelling的可能 。  输出字典中第一次出现的词 。 
思路。。对每一个输入的词。 对字典中每个词找到第一次不同的字母位置。 然后做处理。。。
是有多暴力。。

代码如下：
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<string>dic;
    string tmp;
    while (n--) {
        cin >> tmp;
        dic.push_back(tmp);
    }
    int p;
    cin >> p;
    while (p--) {
        cin >> tmp;
        int i, j;
        string mfs;
        bool cf = 0, mf = 0;
        for (i = dic.size() - 1; i >= 0; i--) {
            int l1 = dic[i].length(), l2 = tmp.length();
            if (tmp == dic[i]) {
                cf = 1;
                break;
            } else if (l1 == l2) {
                for (j = 0;; j++) {
                    if (tmp[j] != dic[i][j])
                        break;
                }
                string tmp1 = tmp;
                if (l1 != 1) {
                    swap(tmp1[j], tmp1[j + 1]);
                    if (tmp1 == dic[i]) {
                        mf = 1;
                        mfs = dic[i];
                    }
                }
                tmp1 = tmp;
                tmp1[j] = dic[i][j];
                if (tmp1 == dic[i]) {
                    mf = 1;
                    mfs = dic[i];
                }
            } else if (abs(l1 - l2) == 1) {
                string tmp1 = tmp, tmp2 = dic[i];
                if (tmp1.length() > tmp2.length())
                    tmp1.swap(tmp2);
                for (j = 0;; j++) {
                    if (tmp2[j] != tmp1[j])
                        break;
                }
                string t = "";
                t += tmp2[j];
                tmp1.insert(j, t);
                if (tmp1 == tmp2) {
                    mf = 1;
                    mfs = dic[i];
                }
            }
        }
        if (cf) {
            cout << tmp << " is correct\n";
        } else if (mf) {
            cout << tmp << " is a misspelling of " << mfs << endl;
        } else cout << tmp << " is unknown\n";
    }
    return 0;
}