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 will include 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.
wwwbbrwrbrbrrbrbrwrwwrbwrwrrb wwwbbrwrbrbrrbrbrwrwwrbwrwrrb
** *****
题目描述
你有一条由N个红色的，白色的，或蓝色的珠子组成的项链(3<=N<=350)，珠子是随意安排的。 这里是 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
图片 A 图片 B
r 代表 红色的珠子
b 代表 蓝色的珠子
w 代表 白色的珠子
第一和第二个珠子在图片中已经被作记号。
图片 A 中的项链可以用下面的字符串表示：
brbrrrbbbrrrrrbrrbbrbbbbrrrrb .
假如你要在一些点打破项链,展开成一条直线，然后从一端开始收集同颜色的珠子直到你遇到一个不同的颜色珠子，在
另一端做同样的事(颜色可能与在这之前收集的不同)。 确定应该在哪里打破项链来收集到最大多数的数目的子。
例如，在图片 A 中的项链，可以收集到8个珠子,在珠子 9 和珠子 10 或珠子 24 和珠子 25 之间打断项链。 在一些项
链中，包括白色的珠子如图片 B 所示。 当收集珠子的时候，一个被遇到的白色珠子可以被当做红色也可以被当做蓝色。表
现项链的字符串将会包括三符号 r ， b 和 w 。 写一个程序来确定从一条被给出的项链最大可以被收集珠子数目。
程序名称
beads
输入格式
第 1 行: N, 珠子的数目
第 2 行: 一串度为N的字符串, 每个字符是 r ， b 或 w。
样例输入
(文件 beads.in)
29
wwwbbrwrbrbrrbrbrwrwwrbwrwrrb
输出格式
单独的一行包含从被供应的项链可以被收集的珠子数目的最大值。
样例输出
(文件 beads.out)
11
========================= 华丽的分割线 =========================
这个题目我用的思路是标程里面的一个代码, 用a表示前一段的连续长度, b表示当前段的连续长度, w表示在当前出现的w的连续数目.. 对于对于循环的话, 就把字符串f再复制一份到f后面….
啥~? 没看懂~? 看样子对于程序员来说最好的语言是代码:
/*
PROG: beads
ID: zqy11001
LANG: C
*/
#include <stdio.h>
#define getint(i) scanf(%d\\n, &n)
int n;
char f[701];
int main(void)
{
int i, limit;
int a = 0, b = 0, w = 0;
char c = \'0\';
int m = 0;
freopen(beads.in, r, stdin);
freopen(beads.out, w, stdout);
getint(n);
limit = 2 * n;
fgets(f, 351, stdin);
memcpy(f + n, f, n);
for(i = 0; i < limit; i++){
if(f[i] == \'w\'){
b++;
w++;
}else if(f[i] == c){
b++;
w = 0;
}else{
if(b + a > m){
m = b + a;
}
a = b - w;
b = w + 1;
w = 0;
c = f[i];
}
}
if(a + b > m){
m = b + a;
}
printf(%d\\n, m > n ? n : m);
return 0;
}