zoukankan      html  css  js  c++  java
  • Count the string(hdu3336)

    Count the string

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 7190    Accepted Submission(s): 3318


    Problem Description
    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.
     
    Input
    The 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.
     
    Output
    For 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
    思路:KMP(next数组)+DP;
    dp[i]=(dp[next2[i]]+1)%mod;dp转移方程;
    表示以i结尾时所有与[1,i] 不同前缀新增加的个数。aaaaa
    dp[1]=1;dp[2]=2(表示新增 a aa);dp[3]=3(aaa,aa,a).......
    dp[i]=(dp[next2[i]]+1)的原因是比如原来是abaab,假设前面的已经算完,现在增加一个字母,
    abaaba,next[i]=3;所以新增的和为一个aba符合要求,也就是dp[3];还有一个为新串abaaba;
     1 #include<stdio.h>
     2 #include<algorithm>
     3 #include<iostream>
     4 #include<string.h>
     5 #include<stdlib.h>
     6 #include<queue>
     7 #include<cstdio>
     8 #include<math.h>
     9 void next1(int k);
    10 char str[300000];
    11 int next2 [300000];
    12 char strr[300000];
    13 int dp[300000];
    14 const int mod= 10007;
    15 using namespace std;
    16 int main(void)
    17 {
    18     int i,j,k,p,q;
    19     scanf("%d",&k);
    20     while(k--)
    21     {
    22         int sum=0;
    23         scanf("%d",&p);
    24         scanf("%s",str);
    25         int l=strlen(str);
    26         for(i=0; i<l; i++)
    27             {strr[i+1]=str[i];}
    28         next1(l);
    29         for(i=1; i<=l; i++)
    30         {
    31             dp[i]=(dp[next2[i]]+1)%mod;
    32             sum=(sum+dp[i])%mod;
    33         }
    34         printf("%d
    ",sum);
    35     }
    36     return 0;
    37 }
    38 
    39 void next1(int k)
    40 {
    41     int i,j;
    42     next2[0]=0;
    43     next2[1]=0;
    44     j=0;int cnt=0;
    45     for(i=2; i<=k; i++)
    46     {
    47         while(j>0&&strr[j+1]!=strr[i])
    48         {
    49             j=next2[j];
    50         }
    51         if(strr[j+1]==strr[i])
    52         {
    53             j++;
    54         }
    55         next2[i]=j;cnt++;
    56     }
    57 }
     
     
    油!油!you@
  • 相关阅读:
    win8 vs2010 openni2 配置
    写一个程序,分析一个文本文件(英文文章)中各个词出现的频率,并且把频率最高的十个词打印出来。
    电梯调度
    new 一个button 然后dispose,最后这个button是null吗???
    org.apache.hadoop.security.AccessControlException
    算法导论第二章、插入排序
    算法导论第六章、堆排序
    算法导论第八章、计数排序
    观后感
    第二次随笔
  • 原文地址:https://www.cnblogs.com/zzuli2sjy/p/5187037.html
Copyright © 2011-2022 走看看