【HDOJ】1483 Automatic Correction of Misspellings

水模拟题。

 /* 1483 */
 #include <cstdio>
 #include <cstring>
 #include <cstdlib> #define MAXN 10005 typedef struct {
     char s[];
     int len;
 } node_t; node_t node[MAXN];
 char s[];
 int len, v;
 int n, m;
 int flag; int abs(int x) {
     return x< ? -x:x;
 } int min(int a, int b) {
     return a<b ? a:b;
 } int max(int a, int b) {
     return a<b ? a:b;
 } void solve() {
     int i, j, k, p, tmp;
     int stack[], top;
     flag = ;     // check if is correct
     for (i=; flag&&i<n; ++i) {
         if (node[i].len==len) {
             // swap 2 char or 1 char wrong or just the same
             k = ;
             top = ;
             for (j=; k<=&&j<len; ++j) {
                 if (node[i].s[j] != s[j]) {
                     stack[top++] = j;
                     ++k;
                 }
             }
             if (k == ) {
                 flag = ;
                 v = i;
                 break;
             } else if (k== && flag>) {
                 flag = ;
                 v = i;
             } else if (k== && flag>) {
                 if (node[i].s[stack[]]==s[stack[]] && node[i].s[stack[]]==s[stack[]]) {
                     flag = ;
                     v = i;
                 }
             }
         } else if (flag> && node[i].len-len==) {
             // one letter is missing
             bool st = true;
             for (j=k=; k<node[i].len; ++k) {
                 if (node[i].s[k] == s[j])
                     ++j;
                 else if (st)
                     st = false;
                 else
                     break;
             }
             if (k >= node[i].len) {
                 flag = ;
                 v = i;
             }
         } else if (flag> && len-node[i].len==) {
             // too much
             bool st = true;
             for (k=,j=; j<len; ++j) {
                 if (node[i].s[k] == s[j])
                     ++k;
                 else if (st)
                     st = false;
                 else
                     break;
             }
             if (j>=len) {
                 flag = ;
                 v = i;
             }
         }
     }
 } int main() {
     int i, j, k, tmp;     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
     #endif     while (scanf("%d", &n) != EOF) {
         for (i=; i<n; ++i) {
             scanf("%s", node[i].s);
             node[i].len = strlen(node[i].s);
         }
         scanf("%d", &m);
         while (m--) {
             scanf("%s", s);
             len = strlen(s);             solve();
             if (flag == )
                 printf("%s is unknown\n", s);
             else if (flag == )
                 printf("%s is correct\n", s);
             else if (flag == )
                 printf("%s is a misspelling of %s\n", s, node[v].s);
         }
     }     return ;
 }