1071 Speech Patterns (25分)

最新推荐文章于 2025-01-02 01:02:14 发布

原创最新推荐文章于 2025-01-02 01:02:14 发布 · 96 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

126 篇文章

订阅专栏

本文探讨了通过分析个人言语偏好来识别说话者身份的方法，特别关注于如何从文本样本中找出最常使用的词汇，这对于在线身份验证至关重要。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzing such patterns can help to narrow down a speaker's identity, which is useful when validating, for example, whether it's still the same person behind an online avatar.

Now given a paragraph of text sampled from someone's speech, can you find the person's most commonly used word?

Input Specification:

Each input file contains one test case. For each case, there is one line of text no more than 1048576 characters in length, terminated by a carriage return \n. The input contains at least one alphanumerical character, i.e., one character from the set [0-9 A-Z a-z].

Output Specification:

For each test case, print in one line the most commonly occurring word in the input text, followed by a space and the number of times it has occurred in the input. If there are more than one such words, print the lexicographically smallest one. The word should be printed in all lower case. Here a "word" is defined as a continuous sequence of alphanumerical characters separated by non-alphanumerical characters or the line beginning/end.

Note that words are case insensitive.

Sample Input:

Can1: "Can a can can a can?  It can!"

Sample Output:

can 5

题意：找出现频次最多的单词，输出小写表示且输出次数

思路：神坑，最后一个节点：句子中最后一个字符不是非法字符时，就会造成少统计这个词语，需要在for循环后再判断一次，或者用个骚操作，把for循环中的i的条件变为等于s的长度，因为最后一个字符肯定是"\n"，所以就可以骚一波了～

#include<iostream>

#include<cstring>
#include<unordered_map>
#include<map>

using namespace std;

int main(){
    unordered_map<string, int> un_map;
    // map<string, int> un_map;
    string s;
    getline(cin, s);
    string temp_s = "";
    bool flag = false;

    for(int i = 0; i <= s.length(); i++){
        
        if(isalnum(s[i])){
            if(isalpha(s[i])){

                temp_s += tolower(s[i]);
                
            }else
            {
                temp_s += s[i];
            }
            
            flag = true;

        }else
        {
            if(flag && temp_s != ""){
                un_map[temp_s]++;
                flag = false;
    
            }
            temp_s = "";
        }
        

    }
    int max = -1;
    string out_s = "";
    for(auto i : un_map){
        if(i.second > max){

            max = i.second;
            out_s = i.first;
        }
        else if(i.second == max && i.first < out_s)
        {
            out_s = i.first;
        }
        

    }
    printf("%s %d", out_s.c_str(), max);
    return 0;
}