[HDU 3336] Count the string [KMP next 배열의 교묘한 응용]

3667 단어 항상 안 되는 DP.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. 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 6
dpdp[i]=dp[next[i]]+1을 사용할 수 있다니;
#include
using namespace std ;
typedef long long LL ;

const int MAXN = 200000+10 ;
const int MAXM = 1e5 ;
const int mod  =10007 ;

int m;
char str[MAXN];
int dp[MAXN],nexts[MAXN];
void getn(){
    int i,j;i=j=0;
    nexts[0]=-1;j=-1;
    while(iif(j==-1||str[i]==str[j]) nexts[++i]=++j;
        else j=nexts[j];
    }
}

int main(){
    int t;scanf("%d",&t);
    while(t--){
        int n;scanf("%d",&n);
        scanf("%s",str);
        m=strlen(str);
        getn();
        int ans=0;
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=m;i++){
            dp[i]=dp[nexts[i]]+1;
            ans=(ans+dp[i]%mod)%mod;
        }
        printf("%d
",ans);
    }

    return  0;
}
hdu 4427 Math Magic(DP, 레벨 4)
Docker의 swarm 모드로 분류 환경 만들기

좋은 웹페이지 즐겨찾기

개발자 우수 사이트 수집

개발자가 알아야 할 필수 사이트 100선 추천 우리는 당신을 위해 100개의 자주 사용하는 개발자 학습 사이트를 정리했습니다
best100-homepage