2020多校第四场Equal Sentences

思路

如果相邻两单词相同，则交换后不改变，则f[i+1]=f[i];
如果不相等，则交换，那么f[i] = f[i-1] + f[i-2];一直到f[n]时算出结果。

代码

#include <bits/stdc++.h>
#define hi cout<<"hi\n";
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
using namespace std;
const ll mod = 1e9+7;
const int maxn = 100005;
ll power(long long a, long long b, long long mode)
{
    long long sum = 1;
    while (b)
    {
        if (b & 1)
        {
            sum = (sum * a) % mode;
            b--;
        }
        b /= 2;
        a = a * a % mode;
    }
    return sum;
}
ll gcd(int a,int b)
{
    if(b==0)
        return a;
    else
        return gcd(b,a%b);
}
ll lcm(int a,int b)
{
    return a/gcd(a,b)*b;
}
ll f[100005];string s[100005];
int main()
{
    int T;
    cin>>T;
    
    f[0]=f[1]=1;
    f[2]=2;
    for(int i=3;i<100005;i++)
        f[i]=(f[i-1]+f[i-2])%mod;
    while(T--)
    {
        int n;cin>>n;
        for(int i = 0; i < n; i++) cin >> s[i]; s[n] = s[n - 1];
        ll ans = 1, cnt = 0;
        int flag = false;
        for(int i = 1; i <= n; i++) {
            if(s[i] != s[i - 1]) {
                cnt++;
                flag = false;
            }
            else if(!flag) {
                flag = true;
                ans = ans * f[cnt + 1] % mod;
                cnt = 0;
            }
        }
        cout << ans << endl;
    }
}