zoukankan      html  css  js  c++  java
  • 1030

    1030 - Discovering Gold
    Time Limit: 2 second(s) Memory Limit: 32 MB

    You are in a cave, a long cave! The cave can be represented by a 1 x N grid. Each cell of the cave can contain any amount of gold.

    Initially you are in position 1. Now each turn 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 the cave, then you keep throwing again until you get a suitable result. When you reach the Nth position you stop your journey. Now you are given the information about the cave, you have to find out the expected number of gold you can collect using the given procedure.

    Input

    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 of this line 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 no integer will be greater than 1000.

    Output

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

    Sample Input

    Output for Sample Input

    3

    1

    101

    2

    10 3

    3

    3 6 9

    Case 1: 101.0000000000

    Case 2: 13.000

    Case 3: 15


    PROBLEM SETTER: JANE ALAM JAN
    思路:概率dp;
    比较水看代码就能明白。
     1 #include<stdio.h>
     2 #include<string.h>
     3 #include<stdlib.h>
     4 #include<algorithm>
     5 #include<iostream>
     6 #include<math.h>
     7 #include<queue>
     8 #include<stack>
     9 using namespace std;
    10 double cost[105];
    11 double dp[105];
    12 int main(void)
    13 {
    14         int i,j,k;
    15         scanf("%d",&k);
    16         int s;
    17         for(s=1; s<=k; s++)
    18         {
    19                 int n;
    20                 scanf("%d",&n);
    21                 for(i=1; i<=n; i++)
    22                 {
    23                         scanf("%lf",&cost[i]);
    24                 }
    25                 memset(dp,0,sizeof(dp));
    26                 dp[1]=1;double sum=0;
    27                 for(i=1;i<=n;i++)
    28                 {
    29                     int t=min(i+6,n);
    30                     for(j=i+1;j<=t;j++)
    31                     {
    32                         dp[j]+=1.0*dp[i]/(t-i);
    33                     }
    34                     sum+=cost[i]*dp[i];
    35                 }
    36                 printf("Case %d: %.10f
    ",s,sum);
    37         }
    38         return 0;
    39 }
    油!油!you@
  • 相关阅读:
    jdb应用 远程调试
    maven POM总结
    jvm
    jdbc取出表名 名称
    nginx配置openssl证书
    DNS A记录 CNAME NS记录等的区别
    linux文件目录类命令|--cd指令
    linux文件目录类命令--ls命令
    linux文件目录类命令--pwd命令
    linux 帮助指令
  • 原文地址:https://www.cnblogs.com/zzuli2sjy/p/5602443.html
Copyright © 2011-2022 走看看