H - Discovering Gold

原题（Lightoj - 1030） 

You are in a cave, a deep cave! The cave can be represented by an 1 x N grid. Some cells in the cave might contain gold!

Initially, you are in position 1. In each move, you throw a perfect 6 sided dice. If you get X in the dice after throwing, you add X to your position and collect all the gold from the new position. If your new position is outside of the cave, you keep throwing the dice again until you get a suitable result. When you reach the Nth position you stop your journey.

Given the information about the cave, you have to find the expected amount of gold you can collect using the procedure described above.

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains a blank line and an integer N (1≤ N ≤ 100) denoting the dimension of the cave. The next line contains N space separated integers. The ith integer denotes the amount of gold you will get if you come to the ith cell. You may safely assume that all the given integers will be non-negative and not greater than 1000.

For each case, print the case number and the expected number of gold you will collect. Errors less than 10-6 will beignored.

样例

输入：

3

1
101

2
10 3

3
3 6 9

输出：

Case 1: 101
Case 2: 13.000000
Case 3: 15.0000000000

思路

递推，建一个  f  数组 用来记录到达每个点的概率，然后用flag 记录在某一点时候，能达到的位置，然后不断递推即可

代码

#include<iostream>
#include<string.h>
#define ll long long
#define maxq 1e18+1 
using namespace std;
int N;
int n;
long double f[105];
int a[105];
int q;

int main()
{
	cin >> N ;
	while(N--)
	{
		cin >> n;
		q++;
		memset(f,0,sizeof(f));
		for(int i=1;i<=n;i++)
			cin >> a[i];
		long double flag;
		f[1]=1.0;
		for(int i=1;i<n;i++)
		{
			int k=n-i;
			flag=min(k,6);
			for(int j=1;j<=flag;j++)
				f[i+j]+=f[i]*(1.0/flag);
		} 
		long double sum=0.0;
		for(int i=1;i<=n;i++)
			sum+=f[i]*a[i];
		printf("Case %d: %.8Lf\n",q,sum);
	}
	return 0;
}