题意:
给出一个串,若能找出一组AB和BA,且互不重合。
思路:
离散化后暴力找匹配。
#include <bits/stdc++.h>
using namespace std;
const int MAXN=1e5+10;
int flag1[MAXN];
int flag2[MAXN];
int main()
{
//ios::sync_with_stdio(false);
char a[MAXN];
while(~scanf("%s",a)){
memset(flag1,0,sizeof(flag1));
memset(flag2,0,sizeof(flag2));
int len=strlen(a);
bool ans=0;
int pp=-1;
int ppp=-1;
for(int i=0;i<len-1;i++){
if(a[i]=='A'&&a[i+1]=='B')
flag1[++pp]=i;
else if(a[i]=='B'&&a[i+1]=='A')
flag2[++ppp]=i;
}
for(int i=0;i<=pp&&!ans;i++){
for(int j=0;j<=ppp&&!ans;j++)
if(flag1[i]!=flag2[j]+1&&flag1[i]!=flag2[j]-1)
ans=1;
}
if(ans)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
}
Description
You are given string s. Your task is to determine if the given string s contains two non-overlapping substrings "AB" and "BA" (the substrings can go in any order).
Input
The only line of input contains a string s of length between 1 and 105 consisting of uppercase Latin letters.
Output
Print "YES" (without the quotes), if string s contains two non-overlapping substrings "AB" and "BA", and "NO" otherwise.
Sample Input
ABA
NO
BACFAB
YES
AXBYBXA
NO
Hint
In the first sample test, despite the fact that there are substrings "AB" and "BA", their occurrences overlap, so the answer is "NO".
In the second sample test there are the following occurrences of the substrings: BACFAB.
In the third sample test there is no substring "AB" nor substring "BA".