HDU1247——Hat’s Words（map黑科技，字符串）

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Description
A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.
You are to find all the hat’s words in a dictionary.

Input
Standard input consists of a number of lowercase words, one per line, in alphabetical order. There will be no more than 50,000 words.
Only one case.

Output
Your output should contain all the hat’s words, one per line, in alphabetical order.

Sample Input
a
ahat
hat
hatword
hziee
word

Sample Output
ahat
hatword

题意：找到所有可以由其它单词组合起来的单词。
到网上看到的map使用黑科技。

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <iostream>
using namespace std;

#define INF 1e9+7
#define MAXN 50010

map <string, int> a;

string str[MAXN];

int main() {
    int n=0;
    while(cin>>str[n])
    {
        a[str[n]]=1;
        n++;
    }
    for(int i = 0; i <= n; i++) {
        int e = (int)str[i].size()-1;
        for(int j = 1; j < e; j++) {
            //这是string的初始化，直接把str[i]分成两个部分，再做lgn的查询
            string s1(str[i], 0, j);
            string s2(str[i], j);
            if(a[s1] == 1 && a[s2] == 1) {
                cout << str[i] << endl;
                break;
            }
        }
    }
    return 0;
}