Hihocoder-1135-Magic Box?

#1135 : Magic Box

時間限制:10000ms 單點時限:1000ms 內存限制:256MB

描述

The circus clown Sunny has a magic box. When the circus is performing, Sunny puts some balls into the box one by one. The balls are in three colors: red(R), yellow(Y) and blue(B). Let Cr, Cy, Cb denote the numbers of red, yellow, blue balls in the box. Whenever the differences among Cr, Cy, Cb happen to be x, y, z, all balls in the box vanish. Given x, y, z and the sequence in which Sunny put the balls, you are to find what is the maximum number of balls in the box?ever.

For example, let's assume x=1, y=2, z=3 and the sequence is RRYBRBRYBRY. After Sunny puts the first 7 balls, RRYBRBR, into the box, Cr, Cy, Cb are 4, 1, 2 respectively. The differences are exactly 1, 2, 3. (|Cr-Cy|=3, |Cy-Cb|=1, |Cb-Cr|=2) Then all the 7 balls vanish. Finally there are 4 balls in the box, after Sunny puts the remaining balls. So the box contains 7 balls at most, after Sunny puts the first 7 balls and before they vanish.

輸入

Line 1: x y z

Line 2: the sequence consisting of only three characters 'R', 'Y' and 'B'.

For 30% data, the length of the sequence is no more than 200.

For 100% data, the length of the sequence is no more than 20,000, 0 <= x, y, z <= 20.

輸出

The maximum number of balls in the box?ever.

提示

Another Sample

Sample Input	Sample Output
0 0 0 RBYRRBY ? ? ? ? ? ?	4

?

?

樣例輸入

1 2 3 RRYBRBRYBRY

樣例輸出

7

?

題解：

利用模擬法，模擬通過。

?

#include <cstdio> #include <cstdlib> #include <cstring> using namespace std; const int MAXN = 20005; int x, y, z, cr, cy, cb; bool judge(){if(abs(cr-cy)==x && abs(cr-cb)==y && abs(cy-cb)==z){return true; }else if(abs(cr-cy)==x && abs(cr-cb)==z && abs(cy-cb)==y){return true; }else if(abs(cr-cy)==y && abs(cr-cb)==z && abs(cy-cb)==x){return true; }else if(abs(cr-cy)==y && abs(cr-cb)==x && abs(cy-cb)==z){return true; }else if(abs(cr-cy)==z && abs(cr-cb)==x && abs(cy-cb)==y){return true; }else if(abs(cr-cy)==z && abs(cr-cb)==y && abs(cy-cb)==x){return true; }else{return false; } }int main(){int len, cnt, ans; char str[MAXN]; while(scanf("%d%d%d", &x, &y, &z) != EOF){scanf("%s", str); len = strlen(str); cnt = 0; cr = cy = cb = 0; ans =0; for(int i=0; i<len; ++i){if(str[i] == 'R'){cr++; }else if(str[i] == 'B'){cb++; }else{cy++; }cnt++; if(cnt > ans){ans = cnt; }if(judge()){cr = 0; cb = 0; cy = 0; cnt = 0; }}printf("%d\n", ans );}return 0; }

　　

?

轉載于:https://www.cnblogs.com/zhang-yd/p/6395585.html

總結

以上是生活随笔為你收集整理的Hihocoder-1135-Magic Box的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。