zoukankan      html  css  js  c++  java
  • HDU-1381 Crazy Search

    http://i.cnblogs.com/EditPosts.aspx?opt=1

    hash:这题可以把字符串转换成数值,然后判断数值是否重复。转换成nc进制的数来表示。

            Crazy Search

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


    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<cstring>
    #include<cstdio>
    #define N 16000005
    using namespace std;
    char str[1000000];
    int cnt[1000000];
    bool hash[16000000];
    int d[128];
    int main()
    {
        int T,n,m,i,j;
        scanf("%d",&T);
        while(T--)
        {
            memset(d,0,sizeof(d));
            memset(cnt,0,sizeof(cnt));
            memset(hash,0,sizeof(hash));
            scanf("%d%d",&n,&m);
            scanf("%s",str);
            int len=strlen(str);
            for(i=0; i<len; i++)
                cnt[i]=str[i]-'a';
            i=0;
            int k=0;
            while(i<len)
            {
                if(d[cnt[i]]==0)
                    d[cnt[i]]=k++;
                    i++;
            }
            int ans=0;
            for(i=0; i<len-n+1; i++)
            {
                int sum=0;
                for(j=i; j<i+n; j++)
                {
                    sum=sum*m+d[cnt[j]];
                }
               if(!hash[sum])
                {
                    ans++;
                    hash[sum]=true;
                }
            }
            printf("%d
    ",ans);
            if(T) printf("
    ");
        }
        return 0;
    }
     
  • 相关阅读:
    利用idea里面的mysql插件进行导入sql文件
    JSTL标签
    deepin20系统下配置JAVA开发环境
    deepin20安装及问题解决
    SpringBoot 在项目启之后执行自定义方法的两种方式
    Nick 的经验书
    Java 经验书
    SpringBoot 经验书
    Linux 经验书
    在MacOS中启动SSH服务
  • 原文地址:https://www.cnblogs.com/cancangood/p/3968941.html
Copyright © 2011-2022 走看看