当前位置:首页 >> 学科竞赛 >>

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: 12 12 rbbr brrb

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 rbr rrw 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 ****** ***** rrrrrb bbbbb <-- assignments 5 x r 6 x b <-- 11 total


相关文章:
USACO Tips 分析
Broken Necklace Prime Palindromes Mixing Milk Barn Repair What Time Is It Checker Challenge Number Triangles Superprime Rib 难度系数 10% 30% 50% 40% 30...
教案050903-全面的考虑问题
输出: 9 2、项链(ioi93t1 usacogate/broken necklace)文件名 necklace.pas,necklace.in,necklace.out 有一条 n(3<n<350)个珠子穿成的项链,珠子有红(red) ...
Broken Square
Broken Necklace 2页 1财富值 Broken vow 2页 免费 Broken Vow 2页 免费 broken computer3-4 18页 2财富值 wire broken 3页 1财富值 The Broken Boot 8页...
信息学奥林匹克竞赛中得高分的关键环节——测试 (DEMO)
我们以 USACO Gate 1.2.1《断开的项链》 (Broken Necklace)一题为例介绍等价划分的方法。 【例】断开的项链 有一条 n(3<n<350)个珠子穿成的项链,珠子有...
USACO题解(NOCOW整理版)
Broken Necklace (beads) 这道题用标准的搜索是 O(n^2)的,可以用类似动态规划的方法优化到 O(n)。 用数组 bl,br,rl,rr 分别记录在项链 i 处向左向右...
整理的算法的题
("\n"); return 0; } D Broken Necklace You have a necklace of N red...Suppose you are to break the necklace at some point, lay it out straight...
编程中得高分的关键--测试
我们以 USACO Gate 1.2.1《断开的项链》(Broken Necklace)一题为例介绍等价划分的方法。 【例】断开的项链 有一条 n(3<n<350)个珠子穿成的项链,珠子有红...
枚举法、模拟法
输出: 9 例1、 断开的项链(ioi93t1 usacogate/broken necklace)文件名 necklace.pas,necklace.in,necklace.out 有一条 n(3<n<350)个珠子穿成的项链,珠子有...
算法解题报告
Broken Necklace a) 问题分析:一串项链由 rwb 三种字符组成,在项链中找到一个点断开,然后分别 从断点的左侧和右侧统计相同珠子的个数,例如 rwbbbrbb rwwbrr,中间...
USACOchapter1
USACO 1.2.1 Broken Necklace (beads) 原创 北极天南星 查看评论 2005-12-22 00:41:49 这道题用标准的搜索是 O(n^2)的,可以用类似动态规划的方法优化到 ...
更多相关标签:
broken necklace题解 | sublime text 2 c++ | necklace | the necklace | statement necklace | pearl necklace | the red necklace | the necklace 分析 |