Rock Paper Scissors （FFT）

题意：你正在玩石头剪刀布的游戏，现在你有两个字符串s1,s2分别表示玩游戏时的策略，现在你需要从s1中选取一段使得s1能赢s2s的次数尽可能的多。

思路：选取一种出拳方式在s1中定义为1，其余为0 ，在s2中选取你能赢的定义为1，其余为0，对于每一种pos只比较你能赢的次数为

 然后反过来就会变成卷积：

 

#include<bits/stdc++.h>
#define pi acos(-1)
#define MAXN 1048576
#define eps 1e-1

using namespace std;
typedef long long ll;
typedef complex<double> E;

void bit_reverse(int N, E *r){
    for(int i = 0, j = 0; i < N; i ++){
        if(i > j) swap(r[i], r[j]);
        for(int l = N >> 1; (j ^= l) < l; l >>= 1);
    }
}

void fft(E *r, int N, int f){
    bit_reverse(N, r);
    for(int i = 2; i <= N; i <<= 1){
        int m = i >> 1;
        for(int j = 0; j < N; j += i){
            E w(1, 0); E wn(cos(2 * pi / i), f * sin(2 * pi / i));
            for(int k = 0; k < m; k ++){
                E z = r[j + k + m] * w;
                r[j + k + m] = r[j + k] - z;
                r[j + k] = r[j + k] + z;
                w *= wn;
            }
        }
    }
    if(f == -1){
        for(int i = 0; i < N; i ++) r[i] /= N;
    }
}
E a[MAXN], b[MAXN];
int ans1[MAXN], ans2[MAXN], ans3[MAXN];
int m, n, N;
char S1[300005], S2[300005];
int s1[300005], s2[300005];

int main(){
    scanf("%d%d", &n, &m);
    N = 1;
    while(N <= (m + n + m)) N <<= 1;
    scanf("%s", S2 + 1);
    scanf("%s", S1 + 1);
    for(int i = 1; i <= m / 2; i ++){
        swap(S1[i], S1[m - i + 1]);
    }
    for(int i = 1; i <= m; i ++){
        if(S1[i] == 'R') s1[i] = 1;
        else s1[i] = 0;
    }
    for(int i = 1; i <= n; i ++){
        if(S2[i] == 'S') s2[i] = 1;
        else s2[i] = 0;
    }
    for(int i = 0; i < N; i ++) a[i] = b[i] = 0;
    for(int i = 1; i <= m; i ++){
        a[i - 1] = 1ll * s1[i];
    }
    for(int i = 1; i <= n; i ++){
        b[i - 1] = 1ll * s2[i];
    }
    fft(a, N, 1); fft(b, N, 1);
    for(int i = 0; i < N; i ++) a[i] *= b[i];
    fft(a, N, -1);
    for(int i = m; i <= n + m - 1; i ++){
        ans1[i - m + 1] += int(a[i - 1].real() + 0.01);
    }
    for(int i = 1; i <= m; i ++){
        if(S1[i] == 'S') s1[i] = 1;
        else s1[i] = 0;
    }
    for(int i = 1; i <= n; i ++){
        if(S2[i] == 'P') s2[i] = 1;
        else s2[i] = 0;
    }
    for(int i = 0; i < N; i ++) a[i] = b[i] = 0;
    for(int i = 1; i <= m; i ++){
        a[i - 1] = 1ll * s1[i];
    }
    for(int i = 1; i <= n; i ++){
        b[i - 1] = 1ll * s2[i];
    }
    fft(a, N, 1); fft(b, N, 1);
    for(int i = 0; i < N; i ++) a[i] *= b[i];
    fft(a, N, -1);
    for(int i = m; i <= n + m - 1; i ++){
        ans2[i - m + 1] += int(a[i - 1].real() + 0.01);
    }
    for(int i = 1; i <= m; i ++){
        if(S1[i] == 'P') s1[i] = 1;
        else s1[i] = 0;
    }
    for(int i = 1; i <= n; i ++){
        if(S2[i] == 'R') s2[i] = 1;
        else s2[i] = 0;
    }
    for(int i = 0; i < N; i ++) a[i] = b[i] = 0;
    for(int i = 1; i <= m; i ++){
        a[i - 1] = 1ll * s1[i];
    }
    for(int i = 1; i <= n; i ++){
        b[i - 1] = 1ll * s2[i];
    }
    fft(a, N, 1); fft(b, N, 1);
    for(int i = 0; i < N; i ++) a[i] *= b[i];
    fft(a, N, -1);
    for(int i = m; i <= n + m - 1; i ++){
        ans3[i - m + 1] += int(a[i - 1].real() + 0.01);
    }
    int tot = 0;
    for(int i = 1; i <= n; i ++){
        tot = max(tot, ans1[i] + ans2[i] + ans3[i]);
    }
    printf("%d\n", tot);
    return 0;
}

大佬题解