Section 1.1 Broken Necklace

Broken Necklace

You have a necklace of N red, white, or blue beads (3<=N<=350) some of which are red, others blue, and others white, arranged at random. Here are two examples for n=29:

                1 2                               1 2
            r b b r                           b r r b
          r         b                       b         b
         r           r                     b           r
        r             r                   w             r
       b               r                 w               w
      b                 b               r                 r
      b                 b               b                 b
      b                 b               r                 b
       r               r                 b               r
        b             r                   r             r
         b           r                     r           r
           r       r                         r       b
             r b r                             r r w
            Figure A                         Figure B
                        r red bead
                        b blue bead
                        w white bead

The beads considered first and second in the text that follows have been marked in the picture.

The configuration in Figure A may be represented as a string of b's and r's, where b represents a blue bead and r represents a red one, as follows: brbrrrbbbrrrrrbrrbbrbbbbrrrrb .

Suppose you are to break the necklace at some point, lay it out straight, and then collect beads of the same color from one end until you reach a bead of a different color, and do the same for the other end (which might not be of the same color as the beads collected before this).

Determine the point where the necklace should be broken so that the most number of beads can be collected.

Example

For example, for the necklace in Figure A, 8 beads can be collected, with the breaking point either between bead 9 and bead 10 or else between bead 24 and bead 25.

In some necklaces, white beads had been included as shown in Figure B above. When collecting beads, a white bead that is encountered may be treated as either red or blue and then painted with the desired color. The string that represents this configuration can include any of the three symbols r, b and w.

Write a program to determine the largest number of beads that can be collected from a supplied necklace.

PROGRAM NAME: beads

INPUT FORMAT

Line 1:	N, the number of beads
Line 2:	a string of N characters, each of which is r, b, or w

SAMPLE INPUT (file beads.in)

29
wwwbbrwrbrbrrbrbrwrwwrbwrwrrb

OUTPUT FORMAT

A single line containing the maximum of number of beads that can be collected from the supplied necklace.

SAMPLE OUTPUT (file beads.out)

11

OUTPUT EXPLANATION

Consider two copies of the beads (kind of like being able to runaround the ends). The string of 11 is marked.

                Two necklace copies joined here
                             v
wwwbbrwrbrbrrbrbrwrwwrbwrwrrb|wwwbbrwrbrbrrbrbrwrwwrbwrwrrb
                       ******|*****
                       rrrrrb bbbbb  <-- assignments
                       rrrrr#bbbbbb  
                       5 x r  6 x b  <-- 11 total

这是一个搜索题。处理环形的手链我们可以用两个一样的字符串处理。

计算i处左右可以收集到多少红色，蓝色的珠子。比较左右最大值。

#include<stdio.h>
#include<string.h>
int min(int x, int y)
{
	int z;
	if (x <= y)z = x;
	else z = y;
	return z;
}
int max(int x, int y){
	int z; 
	if (x >= y)z = x;
	else z = y;
	return z;
}
int main()
{
	freopen("beads.in", "r", stdin);
	freopen("beads.out", "w", stdout);
	char s[800], a[400];
	memset(s, 0, sizeof(s));
	memset(a, 0, sizeof(a));
	int n, m = 0, i, j, k;
	scanf("%d %s", &n, a);
	strcpy(s, a);//字符处理
	strcat(s, a);
	int l[800][2];
	int r[800][2];
	l[0][0] = l[1][0] = 0;
	for (i = 1; i <= 2 * n; i++){//i左右能的到多少珠子，l表示左，0表示红色珠子
		if (s[i - 1] == 'r'){
			l[i][0] = l[i - 1][0] + 1;
			l[i][1] = 0;
		}
		else if (s[i - 1] == 'b'){
			l[i][1] = l[i - 1][1] + 1;
			l[i][0] = 0;
		}
		else if (s[i - 1] == 'w'){
			l[i][0] = l[i - 1][0] + 1;
			l[i][1] = l[i - 1][1] + 1;
		}
	}
	r[2 * n][0] = r[2 * n][1] = 0;
	for (i = 2 * n - 1; i >= 0; i--){
		if (s[i] == 'r'){
			r[i][0] = r[i + 1][0] + 1;
			r[i][1] = 0;
		}
		else if (s[i] == 'b'){
			r[i][1] = r[i + 1][1] + 1;
			r[i][0] = 0;
		}
		else if (s[i] == 'w'){
			r[i][0] = r[i + 1][0] + 1;
			r[i][1] = r[i + 1][1] + 1;
		}
	}

	for (i = 0; i < 2 * n; i++){
		m = max(m, max(l[i][1], l[i][0]) + max(r[i][0], r[i][1]));
	}
	m = min(n, m);//最大有n
	printf("%d\n", m);
	return 0;
}