UVA-10391(字符串检索)

题意：

给定一个字典，要求找出所有的复合词;

思路：

用map把词都存起来,再把词拆开看是否是出现过的单词;

AC代码:

#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

#define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss));

typedef  long long LL;

template<class T> void read(T&num) {
    char CH; bool F=false;
    for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());
    for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());
    F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {
    if(!p) { puts("0"); return; }
    while(p) stk[++ tp] = p%10, p/=10;
    while(tp) putchar(stk[tp--] + '0');
    putchar('
');
}

const LL mod=1e9+7;
const double PI=acos(-1.0);
const int inf=1e9;
const int N=12e4+10;
const int maxn=1e3+10;
const double eps=1e-10;

int n;
string s[N];
map<string,int>mp;
int main()
{
        int cnt =0; 
        while(cin>>s[++cnt])
        {
            mp[s[cnt]]=1;
        }     
        string a,b;
        For(i,1,cnt)
        {
            int len=s[i].size();
            For(j,0,len-1)
            {
                a=s[i].substr(0,j+1);
                b=s[i].substr(j+1);
                if(mp[a]&&mp[b])
                {
                    cout<<s[i]<<"
";
                    break;
                }
            }
        }
        return 0;
}