#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 zLine 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

样例输出

C语言：

//cr，cy，cb三个差值等于x，y，z即可，无需考虑顺序
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
int yxh(const void *p1,const void *p2)
{return *(int *)p1-*(int *)p2;
}
int main()
{int cr,cy,cb,a[3],b[3],i,max;char s[20001];scanf("%d%d%d",&a[0],&a[1],&a[2]);scanf("%s",&s);qsort(a,3,sizeof(int),yxh);//快排for(i=cr=cy=cb=max=0; s[i]!='\0'; i++){if(s[i]=='R'){cr++;}else if(s[i]=='Y'){cy++;}else if(s[i]=='B'){cb++;}b[0]=abs(cr-cy);b[1]=abs(cr-cb);b[2]=abs(cy-cb);qsort(b,3,sizeof(int),yxh);//快排if(a[0]==b[0]&&a[1]==b[1]&&a[2]==b[2]){if(max<cr+cy+cb){max=cr+cy+cb;}cr=cy=cb=0;}}if(max<cr+cy+cb){max=cr+cy+cb;}printf("%d",max);
}

#1135 : Magic Box相关推荐

#1135 : Magic Box（枚举）
#1135 : Magic Box 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 The circus clown Sunny has a magic box. Whe ...
#hihocoder #1135 : Magic Box
hihocoder #1135 : Magic Box 标签(空格分隔): hihocoder 1135 : Magic Box Description The circus clown Sunny ...
hihoCoder #1135 : Magic Box
题目地址:http://hihocoder.com/problemset/problem/1135 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 The circus ...
hihoCoder 1135 Magic Box 微软2016校园招聘在线笔试
这一题写了好久也是醉了..直接模拟即可,注意difference是任意两个count的差,x,y,z不一定按照R,Y,B的顺序. #include<iostream> #include&l ...
hihocoder 1135：Magic Box
1135 : Magic Box 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 The circus clown Sunny has a magic box. When ...
hihoCoder Magic Box
题目题目1 : Magic Box 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 The circus clown Sunny has a magic box. Wh ...
【hihocoder】 Magic Box
题目1 : Magic Box 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 The circus clown Sunny has a magic box. When ...
HDOJ 5155 Harry And Magic Box DP
dp[i][j] 表示长宽为i,j的矩形的可能的总数 dp[i][j+1] 可由 dp[i][j] 推过来,枚举dp[i][j]所保留的行数(1...i)即可 Harry And Magic Box ...
Codeforces Round #143 (Div. 2)-D. Magic Box
原题链接 D. Magic Box time limit per test 2 seconds memory limit per test 256 megabytes input standard i ...

#1135 : Magic Box

#1135 : Magic Box相关推荐

最新文章

热门文章