UVa 409 Excuses, Excuses!

最新推荐文章于 2021-07-28 16:57:40 发布

原创最新推荐文章于 2021-07-28 16:57:40 发布 · 1.3k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#string #2010 #c

UVa 专栏收录该内容

92 篇文章

订阅专栏

本文提供了一种解决UVa在线裁判409题Excuses, Excuses!的方法。通过使用C++实现字符串处理和二分查找算法来统计有效借口的数量，并对输入的借口进行排序和比较，从而找出包含最多有效关键词的借口。

/* coder: ACboy date: 2010-3-6 result: AC description: UVa 409 Excuses, Excuses! */ #include <iostream> #include <algorithm> #include <string> #include <vector> #include <sstream> using namespace std; struct node { string str; int num; node(string a = "") : str(a), num() {} }; vector<node> excuess(30); vector<string> keyword(30); int binarySearch(string findStr, int k) { int begin = 0, end = k; int mid; while (begin <= end) { mid = (begin + end) / 2; if (keyword[mid] == findStr) { return 1; } else if (keyword[mid] > findStr) { end = mid - 1; } else { begin = mid + 1; } } return 0; } bool cmp(const node & a, const node & b) { return a.num > b.num; } int main() { int i, j; int k, e; int c = 0; #ifndef ONLINE_JUDGE freopen("409.txt", "r", stdin); #endif while (scanf("%d %d/n", &k, &e) != EOF) { for (i = 0; i < k; i++) { getline(cin, keyword[i]); } sort(keyword.begin(), keyword.begin() + k); for (i = 0; i < e; i++) { string str; getline(cin, str); excuess[i].str = str; int len = str.size(); for (j = 0; j < len; j++) { if (isalpha(str[j])) { str[j] = tolower(str[j]); } else { str[j] = ' '; } } istringstream in; in.str(str); int count = 0; while (!in.eof()) { string temp; in >> temp; count += binarySearch(temp, k); } excuess[i].num = count; } sort(excuess.begin(), excuess.begin() + e, cmp); int max = excuess[0].num; cout << "Excuse Set #" << ++c << endl; for (i = 0; i < e; i++) { if (excuess[i].num == max) { cout << excuess[i].str << endl; } else break; } cout << endl; } return 0; }