Lightbulbs
시간 제한1초메모리 제한256 MB
N개의 행에 M개의 전구가 있고 각 전구는 확률 P로 켜진다. 한 행에서 연속으로 켜진 전구 수의 최댓값의 기댓값을 구한다.
문제
Thomas Edison is actively working on a better version of a lightbulb. During that process, he covers entire fields with batches of lightbulbs and conducts tests on them. In his current experiment, he arranged rows with lightbulbs in each row. Each lightbulb has a chance of working, otherwise, it’s faulty and won’t light up. Thomas wants to find the expected value of the length of the longest horizontal sequence of lightbulbs that are working.
For example, in the setup below, where is a working lightbulb and is faulty, the length of the longest horizontal sequence of lightbulbs that are working is , since there are three consecutive ones in the second row (and also in the fourth row).
1 0 1 1
0 1 1 1
0 1 0 0
1 1 1 0
1 1 0 1
Note that we’re interested in horizontal sequences only.
입력
You’re given three numbers separated by spaces – positive integers and , and a real number .
출력
Output the answer to the problem. Your answer would be considered correct if its absolute or relative error is less than .