这是我通过的代码

#include <iostream>
#include <sstream>
#include <string>
#include <map>
#include <algorithm>
using namespace std;

int main()
{
    // 考虑连续空格和句首空格
    int idx = 0, q_idx = -1, q_flg = 0;
    string query, sentence, word;
    map<string, int> m;
    getline(cin, query);
    transform(query.begin(), query.end(), query.begin(), ::tolower);
    getline(cin, sentence);
    transform(sentence.begin(), sentence.end(), sentence.begin(), ::tolower);
    if (sentence.find(query+" ") != string::npos) // 句首，且有其他单词
    {
        if (sentence[sentence.find(query+" ")-1]== ' '||
            sentence[sentence.find(query+" ")]==0)
        {
            q_idx = sentence.find(query+ " ");
        }
    }
    if (sentence.find(" "+query+" ") != string::npos) // 句中，且有其他单词
    {
        if (q_idx==-1)
        {
            q_idx = sentence.find(" "+query+" ")+1;
        }
    }
    if (sentence.find(" "+query) != string::npos) // 句尾
    {
        if (q_idx==-1)
        {
            q_idx = sentence.find(" "+query)+1;
        }

    }
    if (sentence.compare(query)==0) //句子为1个单词
    {
        if (q_idx==-1)
        {
            q_idx=0;
        }

    }
    stringstream ss(sentence);
    while (ss >> word)
    {
        if (m.find(word) == m.end())
        {
            m.insert(pair<string, int>(word, 1));
        }
        else
        {
            m[word]++;
        }
    }
    if (m.find(query) != m.end())
    {
        cout << m[query] << " " << q_idx;
    }
    else
    {
        cout << -1;
    }
    return 0;
}