lightoj1030（期望dp）

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <math.h>
using namespace std;
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:1024000000,1024000000")
typedef __int64 LL;
const int INF = 1<<30;
/*

*/
const int N = 100 + 10;
double dp
;
int a
;
int main()
{
int t, n;
scanf("%d", &t);
for (int k = 1; k <= t; ++k)
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
dp
= a
;
for (int i = n - 1; i >= 1; --i)
{
double tmp = 0;
for (int j = i + 1; j <= n &&j - i <= 6; ++j)
tmp += dp[j] / 6;
if (n - i < 6)
{
tmp *= 6 / (double)((n - i));
}
dp[i] = tmp + a[i];
}
printf("Case %d: %.6lf\n",k, dp[1]);
}
return 0;
}