USACO 1.1 Broken Necklace
来源:互联网 发布:淘宝lg旗舰店是真是假 编辑:程序博客网 时间:2024/05/16 12:16
这个题就是告诉我们倍长字符串是处理回文的一种常见方式
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 beadsLine 2:a string of N characters, each of which is r, b, or wSAMPLE INPUT (file beads.in)
29wwwbbrwrbrbrrbrbrwrwwrbwrwrrb
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 vwwwbbrwrbrbrrbrbrwrwwrbwrwrrb|wwwbbrwrbrbrrbrbrwrwwrbwrwrrb ******|***** rrrrrb|bbbbb <-- assignments 5xr .....#|##### 6xb 5+6 = 11 total
/*ID: 17702791PROG: beadsLANG: C++*/#include<bits/stdc++.h>using namespace std;#define all(x) (x).begin(), (x).end()#define for0(a, n) for (int (a) = 0; (a) < (n); (a)++)#define for1(a, n) for (int (a) = 1; (a) <= (n); (a)++)typedef long long ll;typedef pair<int, int> pii;const int INF =0x3f3f3f3f;const int maxn= 350 ;char s[maxn+10];int n;void work(){ int ans=1; for(int i=1;i<=2*n;i++) { int c=s[i]; int ret=1; for(int le=i-1;le>=1;le--) { if(c=='w') c=s[le]; if(s[le]!='w'&&s[le]!=c) break; ret++; } c=s[i+1]; for(int ri=i+1;ri<=2*n;ri++) { if(c=='w') c=s[ri]; if(s[ri]!='w'&&s[ri]!=c) break; ret++; } ret=min(n,ret); ans=max(ans,ret); } cout<<ans<<endl;}int main(){ freopen("beads.in","r",stdin); freopen("beads.out","w",stdout); while(~scanf("%d",&n)) { scanf("%s",s+1); for(int i=n+1;i<=2*n;i++) { s[i]=s[i-n]; } s[2*n+1]=0; work(); } return 0;}
- USACO 1.1-Broken Necklace
- usaco 1.1:Broken Necklace
- USACO 1.1 Broken Necklace
- usaco 1.1 Broken Necklace
- usaco/ 1.1 Broken Necklace
- USACO 1.1 Broken Necklace
- USACO 1.1 Broken Necklace
- USACO 1.1 Broken Necklace
- USACO 1.1 Broken Necklace
- USACO 1.1.4 Broken Necklace
- USACO 1.1.4 Broken Necklace
- USACO 1.1 broken necklace 分析
- [USACO 1.1.4] Broken Necklace
- USACO 1.1.4 Broken Necklace
- USACO Section 1.1 Broken Necklace
- USACO Section 1.1 Broken Necklace
- USACO 1.1.4 Broken Necklace
- USACO 1.1.4 Broken Necklace
- 递归求斐波那契
- hdu 1045 Fire Net
- 2015中国大学排行榜100强新鲜出炉(校友会版)-[转]
- 正确使用Block避免Cycle Retain和Crash
- xml与javaBean的互相转化
- USACO 1.1 Broken Necklace
- java反射详解
- Mahout推荐算法API详解
- 杭电4548
- 用计时器计算1到100的和
- 各大互联网公司架构演进之路汇总
- HDU NO.1878 欧拉回路(邻接矩阵,判断欧拉回路的条件)
- 日报告提交到周报告
- 冒泡排序