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 5xr .....#|##### 6xb 5+6 = 11 total
题意:就是给你一串环形的柱子,切一刀,从两端取珠子,直到遇到不同色的珠子,问最多能获得多少珠子。。
解题一:暴力,枚举每个切割的位置。网上说有DP做法,复杂度为(N),过段时间再来AC
/**
PROG:beads
LANG:C++
ID:zpc19951
**/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s[555];
int n;
int work1(int l)
{
int p=l-1,ans=0;
char ch=s[l];
while(p!=l) {
if(p<1) p=n;
if(p==l) break;
if(ch=='w') {
if(s[p]!='w') ch=s[p];
}
else {
if(s[p]!=ch &&s[p]!='w') break;
}
ans++;
p--;
}
return ans;
}
int work2(int r)
{
int p=r+1,ans=0;
char ch=s[r];
while(p!=r) {
if(p>n) p=1;
if(p==r) break;
if(ch=='w') {
if(s[p]!='w') ch=s[p];
}
else {
if(s[p]!=ch &&s[p]!='w') break;
}
ans++;
p++;
}
return ans;
}
int main()
{
freopen("beads.in","r",stdin);
freopen("beads.out","w",stdout);
int i,j,ans=2,l,r;
scanf("%d%s",&n,s+1);
for(i=1;i<=n;i++) {
l=i-1;r=i;
if(l<1) l=n;
ans=max(ans,2+work1(l)+work2(r));
}
ans=min(ans,n);
printf("%d\n",ans);
return 0;
}
O(n)的解法: 环形的珠子我们可以展开变成一条直线,相对好处理, 在珠子最后在加一条相同的链子。
DP的思想,开4个数组,维护两端的珠子数。 最后枚举每一个断裂的位置即可
/**
PROG:beads
LANG:C++
ID:zpc19951
**/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1111;
int lr[maxn],lb[maxn],rr[maxn],rb[maxn];
char s[maxn];
int main()
{
freopen("beads.in","r",stdin);
freopen("beads.out","w",stdout);
int n,i,j,ans;
scanf("%d%s",&n,s+1);
for(i=n+1;i<=(n<<1);i++) s[i]=s[i-n];
for(i=1;i<=(n<<1);i++) {
if(s[i]=='w') {
lr[i]=lr[i-1]+1;
lb[i]=lb[i-1]+1;
}
else if(s[i]=='r') {
lr[i]=lr[i-1]+1;
lb[i]=0;
}
else {
lr[i]=0;
lb[i]=lb[i-1]+1;
}
}
for(i=(n<<1);i;i--) {
if(s[i]=='w') {
rr[i]=rr[i+1]+1;
rb[i]=rb[i+1]+1;
}
else if(s[i]=='r') {
rr[i]=rr[i+1]+1;
rb[i]=0;
}
else {
rr[i]=0;
rb[i]=rb[i+1]+1;
}
}
for(i=1;i<=(n<<1);i++) {
ans=max(ans,max(lb[i-1],lr[i-1])+max(rr[i],rb[i]));
}
ans=min(ans,n);
printf("%d\n",ans);
return 0;
}