本文主要是介绍UVa - 123 - Searching Quickly，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
学到的 string.replace(地址， 替换个数， 要替换为）；
这道做的我想骂人， 那个getline真的是很变态， 绝对比得过***。。。。居然不给输出答案，亏我有才试着交交看，结果一不小心就过了。
getline掠我千百遍我待getline如初恋哈哈哈哈哈哈哈哈哈哈
题目大意：
给出些单词跟句子黄（换成纯小写）。 依次查看句子里的单词， 如果不是已给单词，就将此单词换成大写， 存储此句子。
然后将句子输出：
优先级1：按句子大写单词排序。
优先级2：按句子排序。
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<set>
#include<map>using namespace std;int main()
{multimap<string, string> map1;set<string> set1;string str, str1, s;int i, j, h, k, flag = 0;while (getline(cin, str)){if (str == "::")break;set1.insert(str);}while (getline(cin, str1)){for (i = 0; i < str1.length(); i ++)str1[i] = tolower(str1[i]);str = str1;for (i = 0; i < str.length(); i ++){if (isalpha(str[i])){k = i;}while (isalpha(str[i])){s += str[i];i ++;}for (set<string> :: iterator a = set1.begin(); a != set1.end(); a ++){if (*a == s){a = set1.end();a --;flag = 1;}}if (!flag){for (j = 0; j < s.length(); j ++)s[j] = toupper(s[j]);str.replace(k, s.length(), s);map1.insert(make_pair(s, str));str = str1;}s.clear();flag = 0;}}for (multimap<string, string> :: iterator p = map1.begin(); p != map1.end(); p ++){cout << p->second << endl;}return 0;
}
Searching Quickly
| Searching Quickly |
Background
Searching and sorting are part of the theory and practice of computer science. For example, binary search provides a good example of an easy-to-understand algorithm with sub-linear complexity. Quicksort is an efficient 
[average case] comparison based sort.
KWIC-indexing is an indexing method that permits efficient ``human search'' of, for example, a list of titles.
The Problem
Given a list of titles and a list of ``words to ignore'', you are to write a program that generates a KWIC (Key Word In Context) index of the titles. In a KWIC-index, a title is listed once for each keyword that occurs in the title. The KWIC-index is alphabetized by keyword.
Any word that is not one of the ``words to ignore'' is a potential keyword.
For example, if words to ignore are ``the, of, and, as, a'' and the list of titles is:
Descent of Man The Ascent of Man The Old Man and The Sea A Portrait of The Artist As a Young Man
A KWIC-index of these titles might be given by:
a portrait of the ARTIST as a young man the ASCENT of man DESCENT of man descent of MAN the ascent of MAN the old MAN and the sea a portrait of the artist as a young MAN the OLD man and the sea a PORTRAIT of the artist as a young man the old man and the SEA a portrait of the artist as a YOUNG man
The Input
The input is a sequence of lines, the string :: is used to separate the list of words to ignore from the list of titles. Each of the words to ignore appears in lower-case letters on a line by itself and is no more than 10 characters in length. Each title appears on a line by itself and may consist of mixed-case (upper and lower) letters. Words in a title are separated by whitespace. No title contains more than 15 words.
There will be no more than 50 words to ignore, no more than than 200 titles, and no more than 10,000 characters in the titles and words to ignore combined. No characters other than 'a'-'z', 'A'-'Z', and white space will appear in the input.
The Output
The output should be a KWIC-index of the titles, with each title appearing once for each keyword in the title, and with the KWIC-index alphabetized by keyword. If a word appears more than once in a title, each instance is a potential keyword.
The keyword should appear in all upper-case letters. All other words in a title should be in lower-case letters. Titles in the KWIC-index with the same keyword should appear in the same order as they appeared in the input file. In the case where multiple instances of a word are keywords in the same title, the keywords should be capitalized in left-to-right order.
Case (upper or lower) is irrelevant when determining if a word is to be ignored.
The titles in the KWIC-index need NOT be justified or aligned by keyword, all titles may be listed left-justified.
Sample Input
is the of and as a but :: Descent of Man The Ascent of Man The Old Man and The Sea A Portrait of The Artist As a Young Man A Man is a Man but Bubblesort IS A DOG
Sample Output
a portrait of the ARTIST as a young man the ASCENT of man a man is a man but BUBBLESORT is a dog DESCENT of man a man is a man but bubblesort is a DOG descent of MAN the ascent of MAN the old MAN and the sea a portrait of the artist as a young MAN a MAN is a man but bubblesort is a dog a man is a MAN but bubblesort is a dog the OLD man and the sea a PORTRAIT of the artist as a young man the old man and the SEA a portrait of the artist as a YOUNG man
这篇关于UVa - 123 - Searching Quickly的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
