1. Each necklace consists of N randomly arranged red, white and blue beads (3<=N<=350). 2. Participants cut and straighten the necklace somewhere; then collect the same color beads from one end to the other until they meet a different color bead; and then do the same thing from the other end. The color of beads collected at one end can be different from that collected at the other end. ) 3. When encountering white beads, they can be viewed as either blue beads or red beads, depending on the needs of collecting beads. 4. Find a place to cut off the necklace and collect as many pearls of the same color as possible. The winner can get a pearl necklace free of charge. Now please help me to write a program to calculate how many beads can be collected from a necklace. The following examples show two necklaces when N = 29:

Filename	Size	Update
5.定情礼物.cpp	1314	2018-10-08
6.良乡足球场.cpp	958	2018-10-09
7.郭老师爱合并果子.cpp	2022	2018-10-14

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．