【瞎搞】 Codeforces Round #215 (Div. 1) A Sereja and Algorithm

来源：互联网发布：大连知润科技编辑：程序博客网时间：2024/05/29 13:23

点击打开链接

题意，判断一个区间的字符任意组合并且任意连续的3个能否由 "zyx", "xzy", "yxz" 组成能则输出YES else NO

#include <cstdio>#include <cstring>#include <cstdlib>#include <string>#include <iostream>#include <algorithm>#include <sstream>#include <cmath>using namespace std;#include <queue>#include <stack>#include <vector>#include <deque>#include <set>#include <map>#define cler(arr, val)    memset(arr, val, sizeof(arr))typedef long long  LL;const int MAXN = 190001;const int MAXM = 11111;const int INF = 0x3f3f3f3f;const LL mod =1000000007;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1int n,m,l,r;int a[MAXN];int b[MAXN];int c[MAXN];char s[MAXN];int main(){    cin>>s+1;    n=strlen(s+1);    cler(a,0),cler(b,0),cler(c,0);    for(int i=1;i<=n;i++)    {        if(s[i]=='x') a[i]=1;        if(s[i]=='y') b[i]=1;        if(s[i]=='z') c[i]=1;    }    for(int i=1;i<=n;i++)        a[i]=a[i]+a[i-1],b[i]=b[i]+b[i-1],c[i]=c[i]+c[i-1];    cin>>m;    for(int i=0;i<m;i++)    {        scanf("%d%d",&l,&r);        if(r-l+1<=2)        {            printf("YES\n");            continue;        }        int x=a[r]-a[l-1];        int y=b[r]-b[l-1];        int z=c[r]-c[l-1];        int minn=min(x,min(y,z));        int maxx=max(x,max(y,z));        if(maxx-minn<=1) puts("YES");        else puts("NO");    }    return 0;}/**/

0 0