zoukankan      html  css  js  c++  java
  • 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 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)

    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. original 'split' vwwwbbrwrbrbrrbrbrwrwwrbwrwrrb|wwwbbrwrbrbrrbrbrwrwwrbwrwrrb ******|***** rrrrrb|bbbbb <-- assignments 5 x r 6 x b <-- 11 total

     1 /*
     2     ID:qhn9992
     3     PROG:beads
     4     LANG:C++
     5 */
     6 #include <iostream>
     7 #include <cstdio>
     8 #include <cstring>
     9 #include <string>
    10 #include <set>
    11 
    12 using namespace std;
    13 const int INF=0x3f3f3f3f;
    14 
    15 int main()
    16 {
    17     freopen("beads.in","r",stdin);
    18     freopen("beads.out","w",stdout);
    19 
    20     string s,t;
    21     int n,ans=-INF;
    22     cin>>n;
    23     cin>>s;
    24     t=s+s;
    25     for(int i=0;i<n;i++)
    26     {
    27         set<char> st;char last='w';
    28         int cnt=0;
    29         for(int j=i;cnt<=n;j++)
    30         {
    31             if(t[j]=='w')
    32             {
    33                 cnt++;
    34                 continue;
    35             }
    36             if(t[j]=='r')
    37             {
    38                 if(st.count('r')==0)
    39                 {
    40                     st.insert('r');
    41                     last='r';
    42                     cnt++;
    43                 }
    44                 else if(st.count('r'))
    45                 {
    46                     if(last=='r')
    47                         cnt++;
    48                     else
    49                         break;
    50                 }
    51             }
    52             if(t[j]=='b')
    53             {
    54                 if(st.count('b')==0)
    55                 {
    56                     st.insert('b');
    57                     last='b';
    58                     cnt++;
    59                 }
    60                 else if(st.count('b'))
    61                 {
    62                     if(last=='b')
    63                         cnt++;
    64                     else break;
    65                 }
    66             }
    67         }
    68         if(cnt>n) cnt=n;
    69         ans=max(ans,cnt);
    70     }
    71     cout<<ans<<endl;
    72     return 0;
    73 }
  • 相关阅读:
    分页内存管理——虚拟地址到物理地址的转换【转】
    设备树(device tree)学习笔记【转】
    08 在设备树里描述platform_device【转】
    [dts]Device Tree机制【转】
    设备树快速入门【转】
    Linux 设备树详解【转】
    设备树处理之——device_node转换成platform_device【转】
    最新内核3.4)Linux 设备树加载I2C client adapter 的流程(内核3.4 高通)【转】
    基于tiny4412的Linux内核移植 --- aliases节点解析【转】
    Linux 文件系统IO性能优化【转】
  • 原文地址:https://www.cnblogs.com/CKboss/p/3276890.html
Copyright © 2011-2022 走看看