UVa 789 - Indexing

UVA - 789

思路：读取每行并处理每个单词（map自动按key排序）

#include <cstdio>#include <cstring>#include <string>#include <iostream>#include <sstream>#include <algorithm>#include <map>#include <set>using namespace std;int main(void) {char key;int cln = 0;string line, str;map<string, set<int>> r;cin >> key;while (getline(cin, line)) {istringstream is(line);while (is >> str) {if (str[str.size() - 1] < 'A' || str[str.size() - 1] > 'Z') str = str.substr(0, str.size() - 1);if (str[0] == key) {r[str].insert(cln);}}cln++;}for (map<string, set<int>>::iterator i = r.begin(); i != r.end(); i++) {cout << i->first;for (set<int>::iterator j = i->second.begin(); j != i->second.end(); j++)cout << " " << *j;cout << endl;}//system("pause");return 0;}