HDU1381(map)

最新推荐文章于 2020-03-27 12:30:01 发布

晓风残月xj

最新推荐文章于 2020-03-27 12:30:01 发布

阅读量814

点赞数

CC 4.0 BY-SA版权

分类专栏： STL 文章标签： STL 关联容器

本文链接：https://blog.youkuaiyun.com/xiaofengcanyuexj/article/details/8887997

STL 专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一个算法挑战，即在给定文本中找出所有不同长度为N的子字符串数量，并提供了一段C++代码实现。该问题源于一种复杂的文字谜题，需要通过计算机编程来解决。

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

Crazy Search

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1216 Accepted Submission(s): 473

Problem Description

Many people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime number in a given text. Such number could be the number of different substrings of a given size that exist in the text. As you soon will discover, you really need the help of a computer and a good algorithm to solve such a puzzle.

Your task is to write a program that given the size, N, of the substring, the number of different characters that may occur in the text, NC, and the text itself, determines the number of different substrings of size N that appear in the text.

As an example, consider N=3, NC=4 and the text "daababac". The different substrings of size 3 that can be found in this text are: "daa", "aab", "aba", "bab", "bac". Therefore, the answer should be 5.

Input

The first line of input consists of two numbers, N and NC, separated by exactly one space. This is followed by the text where the search takes place. You may assume that the maximum number of substrings formed by the possible set of characters does not exceed 16 Millions.

Output

The program should output just an integer corresponding to the number of different substrings of size N found in the given text.
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Sample Input

1

3 4
daababac

住借用关联容器，熟悉各种容器的用法！

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

int main()
{
string str;
int t,n,m,i;
int tag=0;
cin>>t;
while(t--)
{
  if(tag)
   cout<<endl;
  tag++;
  cin>>n>>m;
  cin>>str;
  map<string,int>ans;
  for(i=0;i<=str.size()-n;i++)
  {
   string temp(str,i,n);
   if(ans.count(temp)==0)
    ans[temp]++;
  }

cout<<ans.size()<<endl;

}
return 0;
}