CodeForces 1238D AB-string

cf題面

解題思路

比勝過程中好像徹底沒有想法來着，打完比賽，羣裏分享的作法也並無看懂……一個月後的今天終於靠官方題解把題補了。

能夠用間接法，總的子串數量減去很差的子串數量就是好的子串數量。而很差的子串就4種——

• ABB...BB
• BAA...AA
• AA...AAB
• BB...BBA

其餘狀況都是好的子串。證實的話分類討論一下就好

• 很差的字母在子串中間
  • 該字母左右的字母是否相等
• 很差的字母在子串邊上
  • 子串中是否存在另外一個和該字母相同的字母

官方題解這麼說的——

Let's call a character \(t_i\) in string \(t_1t_2…t_k\) is bad if there is no such palindrome \(t_lt_{l+1}…t_r\) that \(l\leqslant i\leqslant r\). Any character in substring \(t_2t_3…t_{k−1}\) is good. It can be proven as follows. If \(t_i=t_i+1\) or \(t_i=t_i−1\) then \(t_i\) belong to a palindrome of length 2. If \(t_i\not = t_{i+1}\) and \(t_i≠t_{i−1}\) then \(t_i\) belong to a palindrome \(t_{i−1}…t_{i+1}\).

So only characters \(t1\) and \(tk\) can be bad. But at the same time character \(t1\) is bad if there is no character \(ti\) such that \(i>1\) and \(t_i=t_1\). It is true because substring \(t_1t_2…t_i\) is palindrome (index \(i\) is minimum index such that \(t_i=t_1\)).

So, there are only 4 patterns of bad strings:

1. ABB…BBABB…BB;
2. BAA…AABAA…AA;
3. AA…AABAA…AAB;
4. BB…BBABB…BBA;

All that remains is to count the number of substrings of this kind.

源代碼

寫的有點醜，原本能夠一個循環完事的。

#include<cstdio>

long long n;
char s[300005];
int cnt[300005]={1},seg;
long long ans;
int main()
{
    scanf("%lld",&n);
    scanf("%s",s);
    int pos=0;
    for(int i=1;i<n;i++)
    {
        if(s[i]==s[pos]) cnt[seg]++;
        else
        {
            seg++;
            cnt[seg]=1;
            pos=i;
        }
    }
    //for(int i=0;i<=seg;i++) printf("%d ",cnt[i]);
    ans=n*(n-1)>>1;
    for(int i=1;i<=seg;i++)// cnt[i] and cnt[i-1]
    {
        ans-=cnt[i-1]+cnt[i]-1;
    }
    printf("\n%lld\n",ans);
    return 0;
}