1.1.4Broken Necklace

1. /*
2. ID: awsd1231
3. PROG: beads
4. LANG: C++
5. */
6. #include<iostream>
7. #include<cstdio>
9. usingnamespace std;
11. char necklace[500][2]={0};
12. int num[500]={0};
13. int n;
15. void clearNec(){
16. for(int i =0; i != n; i++)
17. necklace[i][1]=0;
18. }
20. int sumRight(int x){
21. char a = necklace[x][0];
22. int t =0;
23. while(necklace[x+t][0]=='w')
24. a = necklace[x+++t][0];
25. int count =0;
26. for(int i = x; i != n;++i)
27. if(!necklace[i][1]&&(a == necklace[i][0]|| necklace[i][0]=='w'))++count;
28. elsereturn count;
29. for(int i =0; i != x;++i)
30. if(!necklace[i][1]&&(a == necklace[i][0]|| necklace[i][0]=='w'))++count;
31. elsereturn count;
32. return count;
33. }
35. int sumLeft(int x){
36. char a;
37. if(x) a = necklace[x-1][0];
38. else a = necklace[n-1][0];
39. int t =0;
40. while(necklace[x-t][0]=='w')
41. a = necklace[x-++t][0];
42. int count =0;
43. for(int i = x -1; i !=-1;--i)
44. if(a == necklace[i][0]|| necklace[i][0]=='w'){
45. ++count;
46. necklace[i][1]=1;
47. }
48. elsereturn count;
49. for(int i = n -1; i != x -1;--i)
50. if(a == necklace[i][0]|| necklace[i][0]=='w'){
51. ++count;
52. necklace[i][1]=1;
53. }
54. elsereturn count;
55. return count;
56. }
58. int maxSum(){
59. int max =0;
60. for(int i =0; i != n;++i)
61. if(max < num[i]) max = num[i];
62. return max;
63. }
65. int main(){
66. freopen("beads.in","r", stdin);
67. freopen("beads.out","w", stdout);
68. cin >> n;
69. for(int i =0; i != n;++i)
70. cin >> necklace[i][0];
71. for(int i =0; i != n;++i){
72. clearNec();
73. num[i]= sumLeft(i)+ sumRight(i);
74. }
75. cout << maxSum()<< endl;
76. return0;
77. }

 

来自为知笔记(Wiz)