概率与期望第一题 Uva12230 Crossing Rivers

UVA 12230
题意 一个人从A 到 B 有D 距离 其中有 n 条河 求这个人从A 到 B的期望时间 在陆地上速度都是1
河流信息为 p ,l , v 河水离A多远 河水有多长 河水中船的速度
我们首先要对河水分析 得到这个河水啊 只要在中间 那么他无论是往左 还是往右 加起来长度是 4L
又往左往右都是 1/2 概率 那么从船在第一个点 他是 L 如果船在最后一个点 那么是3L
平均下来过河的时间为
$$\frac{1}{l+\text{1*}v}\ast \left(\frac{l}{l+1}+\frac{3l}{l+1}+\frac{\left(l-1\right)\ast 2l}{l+1}\right)=\frac{2l}{v}$$
那么加上人在陆地上的时间$$D-\underset{i=1}{\stackrel{n}{\Sigma }}l\left[i\right]$$ 就是答案了

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 15;
double l[MAX_N],p[MAX_N],v[MAX_N];
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,D,Case = 0;
    while(scanf("%d%d",&n,&D)==2)
    {
    if(!(n+D)) break;
    double ans = 0;
    for(int i = 1;i<=n;++i) scanf("%lf%lf%lf",&p[i],&l[i],&v[i]),ans+=2*l[i]/v[i],D-=l[i];
    ans+=(1.0*D);
    printf("Case %d: %.3f\n\n",++Case,ans);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}