SCU 4438 Censo (字符串hash)

题意：在串b中不断的删除串a，输出剩余的串

分析：hash+前缀和

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <set>
#define FRER() freopen("in.txt","r",stdin)
#define FREW() freopen("out.txt","w",stdout)
#define go int T;cin>>T;for(int kase=0;kase<T;kase++)
#define debug cout<<"****************"<<endl
#define lowbit(x) x&(-x)
#define p 27
#define eps 1e-6
#define mod 1000000007
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int maxn = 5000000 + 7;
ull Hash[maxn];
ull Hashb[maxn];
void Init(){
    Hash[0] = 1;
    for(int i=1;i<maxn;i++) Hash[i] = Hash[i-1] * p;
}
char sa[maxn],sb[maxn],s[maxn];
int main(){
    //FRER();
    //FREW();
    Init();
    while(~scanf("%s%s",sa,sb)){
        int tot = 0;
        ull ha = 0;
        int lena = (int)strlen(sa);
        int lenb = (int)strlen(sb);
        if(lena > lenb){
            cout<<sb<<endl;
            continue;
        }
        //debug;
        Hashb[0] = 0;
        for(int i=0;i<lena;i++) ha = ha * p + sa[i] - 'a' + 1;
        for(int i=0;i<lenb;i++){
            s[tot++] = sb[i];
            Hashb[tot] = Hashb[tot-1] * p + sb[i] - 'a' + 1;
            if((tot>=lena)&&Hashb[tot]-Hashb[tot-lena]*Hash[lena]==ha){
                tot -= lena;
            }
        }
        for(int i=0;i<tot;i++) cout<<s[i];
        cout<<endl;
    }
}