USACO beads

/*
LANG: C++
PROG: beads
*/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <queue>
#include <list>
#include <stack>
using namespace std;
#define NN 16384
#define INF 0x7ffffff
#define N 2000
#define eps 1e-6
#define pi 3.14159265358979626

char s[N];
bool f[N];
int l,Max;

int lcount(int wh)
{
    int i;
    for (i=0;i<l;i++)
    {
        int pos=(wh-i+l)%l;
        if (s[pos]!=s[wh] && s[pos]!='w') return i;
    }

    return l;
}

int rcount(int wh)
{
    int i;
    for (i=0;i<l;i++)
    {
        int pos=(wh+i)%l;
        if (f[pos]==false) return i;
        if (s[pos]!=s[wh] && s[pos]!='w') return i;
    }

    return l;
}

int main()
{
    //freopen("a","r",stdin);
    freopen("beads.in","r",stdin);
    freopen("beads.out","w",stdout);

    scanf("%d\n",&l);
    scanf(" %s",s);
    Max=0;
    for (int i=0;i<l;i++) f[i]=true;
    int count1=0,count2=0;

    for (int i=0;i<l;i++)
    {
        if (s[i]=='w')
        {
            int c1,c2;
            s[i]='b';
            c1=lcount(i);
            s[i]='r';
            c2=lcount(i);
            s[i]='w';

            count1=max(c1,c2);
        }
        else count1=lcount(i);

        f[ (i-count1+1+l)%l ]=false;

        int j=(i+1)%l;
        if (s[j]=='w')
        {
            int c1,c2;
            s[j]='b';
            c1=rcount(j);
            s[j]='r';
            c2=rcount(j);
            s[j]='w';

            count2=max(c1,c2);
        }
        else count2=rcount(j);

        f[ (i-count1+1+l)%l ]=true;
        if (count1+count2>Max) Max=count1+count2;
        //if (Max==9) cout<<i<<' '<<count1<<' '<<count2<<endl;
    }

    cout<<Max<<endl;

    return 0;
}

http://www.nocow.cn/index.php/Translate:USACO/beads

每两个珠子一左一右搜索，若起始珠子为白色，则枚举其为蓝和红。

1循环用下标从0和取余就行。

2打标记防止区域重复。