zoukankan      html  css  js  c++  java
  • HDU3336 Count the string(kmp

    It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example:
    s: "abab"
    The prefixes are: "a", "ab", "aba", "abab"
    For each prefix, we can count the times it matches in s. So we can see that prefix "a" matches twice, "ab" matches twice too, "aba" matches once, and "abab" matches once. Now you are asked to calculate the sum of the match times for all the prefixes. For "abab", it is 2 + 2 + 1 + 1 = 6.
    The answer may be very large, so output the answer mod 10007.

    InputThe first line is a single integer T, indicating the number of test cases.
    For each case, the first line is an integer n (1 <= n <= 200000), which is the length of string s. A line follows giving the string s. The characters in the strings are all lower-case letters.
    OutputFor each case, output only one number: the sum of the match times for all the prefixes of s mod 10007.Sample Input

    1
    4
    abab

    Sample Output

    6

     1 #include<cstdio>
     2 #include<iostream>
     3 #include<cstring>
     4 using namespace std;
     5 const int maxn=1e6+5;
     6 const int mod = 1e4+7;
     7 int net[maxn],len;
     8 char c[maxn];
     9 void getnext(){
    10     int l = strlen(c);
    11     int i = 0,j = -1;
    12     net[0]=-1;
    13     while(i<l){
    14         if(j==-1||c[i]==c[j]) net[++i]=++j;
    15         else j = net[j];
    16     }
    17 }
    18 int main()
    19 {
    20     int t;
    21     cin>>t;
    22     while(t--){
    23         cin>>len>>c;
    24         getnext();
    25         int l = strlen(c),res = 0;
    26         for(int i = 0;i < l;++i){
    27             if(net[i]!=0&&net[i]+1!=net[i+1])res += net[i];
    28         }
    29         cout<<(res+l+net[l])%mod<<endl;
    30     }
    31     return 0;
    32 }
  • 相关阅读:
    机器学习-聚类问题
    机器学习--回归问题
    CreateRemoteThread盲注提权原理分析
    Linux下进程隐藏的方法及其对抗
    常见未授权访问漏洞总结
    Windows日志识别入侵痕迹
    打造自己的弱口令扫描工具
    Linux 命令被劫持,应急处理办法
    攻击Java Web应用--思维导图
    新型横向移动工具原理分析、代码分析、优缺点以及检测方案
  • 原文地址:https://www.cnblogs.com/h404nofound/p/11704057.html
Copyright © 2011-2022 走看看