当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5151:Sit sit sit

题目描述
There are $N$ chairs in a row and and no one on the chairs.Each chair is blue or red.Then comes $N$ students one by one numbered 1,2,3,..,N.For each student, he will find an empty chair to sit on.He won’t sit on the chair if the chair is satisfied the following three conditions.

1.The chair has both left and right adjacent chairs.
2.The left and right adjacent chairs are not empty.
3.The left and right adjacent chairs’ color are different.
If the current student can’t find a chair to sit on, he will go away.

For each student, he may have many choices of chairs to sit on. Your task is to find the number of distinct situations that all students have sat on a chair. As the answer can be rather large, find remainder after dividing the number by $1000000007({10}^{9}+7)$.
输入解释
There are several test cases.
In each test case:
The first line contains a integer $N(1\leq N\leq 100)$.The second line contains $N$ integers.Each integer is either 0 or 1.Integer 0 means blue and 1 means red.
输出解释
For each test case, output the remainder of division of the resulting number by $1000000007({10}^{9}+7)$.
输入样例
3
1 0 0
4
1 0 0 1
输出样例
4
8
来自杭电HDUOJ的附加信息
Recommend heyang

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 BestCoder Round #24

源链接: HDU-5151

最后修改于 2020-10-25T23:20:14+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)