CodeForces 550A Two Substrings 简单题

本文介绍了一个简单的编程问题:如何判断一个给定的字符串中是否包含两个非重叠的子串“AB”和“BA”。通过示例说明了算法实现,并提供了具体的C++代码。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

A. Two Substrings
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Examples
input
ABA
output
NO
input
BACFAB
output
YES
input
AXBYBXA
output
NO
Note

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".

拿一个简单题来当做我的第一篇博客吧,就这样,代码都是自己写的,所有有的可能不是最佳的(๑•̀ㅂ•́)و✧

#include <bits/stdc++.h>

using namespace std;

int main()
{
    string a;
    int len,p,q,k;
    while(cin>>a)
    {
        len=a.size();
        k=p=q=0;
        for(int i=0;i<len;i++)
        {
            if(a[i]=='A')
            {
                if(i+2<len&&a[i+1]=='B'&&a[i+2]=='A')
                {
                    k++;
                    i+=2;
                }
                else if(i+1<len&&a[i+1]=='B')
                {
                    p=1;
                    i++;
                }
            }
            if(a[i]=='B')
            {
                if(i+2<len&&a[i+1]=='A'&&a[i+2]=='B')
                {
                    k++;
                    i+=2;
                }
                else if(i+1<len&&a[i+1]=='A')
                {
                    q=1;
                    i++;
                }
            }
        }
        if(p+q+k>=2)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值