USACO 1.1 Broken Necklace

来源：互联网发布：如何查看mac地址编辑：程序博客网时间：2024/06/06 13:19

/*ID: feijunp1PROG: beadsLANG: C++*//*    暴力求解，算法时间复杂度O(n*n)*/#include <cstdio>#include <cstring>using namespace std;#define DEBUGconst int MAXN = 354;char A[MAXN];int n;int get_next(int i, int d){    int cnt = 0;    char color = 'w';    if(d) i = (i+n-1) % n;    while(cnt != n) {        if(color != 'w' && A[i] != color && A[i] != 'w') {            break;        }        if(color == 'w' && A[i] != 'w') {            color = A[i];        }        if(d) i = (i+n-1) % n;        else i = (i+1) % n;        cnt++;    }    return cnt;}int main() {    #ifdef DEBUG    freopen("in.txt", "r", stdin);    #else    freopen("beads.in", "r", stdin);    freopen("beads.out", "w", stdout);    #endif    scanf("%d%s", &n, A);    int m = 1;    for(int i=0; i<n; i++) {        int s = get_next(i, 1) + get_next(i, 0);        if(s > m) m = s;    }    if(m > n) m = n;    printf("%d\n", m);    return 0;}