CF 668C(Little Artem and Random Variable-概率)
2016-04-30 00:15
411 查看
2个n面骰子,骰子上的数为1~n
同时掷骰子,得到的数为a,b
已知P(min(a,b)=i),P(max(a,b)=i)P(min(a,b)=i),P(max(a,b)=i)求P(a=i),P(b=i)P(a=i),P(b=i)
求出ai=P(min(a,b)>=i),bi=P(max(a,b)<=i)a_i=P(min(a,b)>=i),b_i=P(max(a,b)<=i)
P(a<=i)P(b<=i)=P(max(a,b)<=i)=biP(a<=i)P(b<=i)=P(max(a,b)<=i)=b_i
P(a>=i)P(b>=i)=(1−P(a<=i−1))(1−P(<=i−1))P(a>=i)P(b>=i)=(1-P(a<=i-1))(1-P(<=i-1))
P(a<=i)+P(b<=i)=1+P(a<=i)P(b<=i)−P(a>=i+1)P(b>=i+1)=1+bi−ai+1P(a<=i)+P(b<=i)=1+P(a<=i)P(b<=i)-P(a>=i+1)P(b>=i+1)=1+b_i-a_{i+1}
总之我们发现P(a<=i),P(b<=i)P(a<=i),P(b<=i)由ai,bia_i,b_i唯一确定
且必为一个1元2次方程的2个解
同时掷骰子,得到的数为a,b
已知P(min(a,b)=i),P(max(a,b)=i)P(min(a,b)=i),P(max(a,b)=i)求P(a=i),P(b=i)P(a=i),P(b=i)
求出ai=P(min(a,b)>=i),bi=P(max(a,b)<=i)a_i=P(min(a,b)>=i),b_i=P(max(a,b)<=i)
P(a<=i)P(b<=i)=P(max(a,b)<=i)=biP(a<=i)P(b<=i)=P(max(a,b)<=i)=b_i
P(a>=i)P(b>=i)=(1−P(a<=i−1))(1−P(<=i−1))P(a>=i)P(b>=i)=(1-P(a<=i-1))(1-P(<=i-1))
P(a<=i)+P(b<=i)=1+P(a<=i)P(b<=i)−P(a>=i+1)P(b>=i+1)=1+bi−ai+1P(a<=i)+P(b<=i)=1+P(a<=i)P(b<=i)-P(a>=i+1)P(b>=i+1)=1+b_i-a_{i+1}
总之我们发现P(a<=i),P(b<=i)P(a<=i),P(b<=i)由ai,bia_i,b_i唯一确定
且必为一个1元2次方程的2个解
#include<bits/stdc++.h> using namespace std; #define For(i,n) for(int i=1;i<=n;i++) #define Fork(i,k,n) for(int i=k;i<=n;i++) #define Rep(i,n) for(int i=0;i<n;i++) #define ForD(i,n) for(int i=n;i;i--) #define ForkD(i,k,n) for(int i=n;i>=k;i--) #define RepD(i,n) for(int i=n;i>=0;i--) #define Forp(x) for(int p=Pre[x];p;p=Next[p]) #define Forpiter(x) for(int &p=iter[x];p;p=Next[p]) #define Lson (o<<1) #define Rson ((o<<1)+1) #define MEM(a) memset(a,0,sizeof(a)); #define MEMI(a) memset(a,127,sizeof(a)); #define MEMi(a) memset(a,128,sizeof(a)); #define INF (2139062143) #define F (100000007) #define pb push_back #define mp make_pair #define fi first #define se second #define vi vector<int> #define pi pair<int,int> #define SI(a) ((a).size()) typedef long long ll; typedef unsigned long long ull; ll mul(ll a,ll b){return (a*b)%F;} ll add(ll a,ll b){return (a+b)%F;} ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;} void upd(ll &a,ll b){a=(a%F+b%F)%F;} int read() { int x=0,f=1; char ch=getchar(); while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();} while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();} return x*f; } #define N (100010) double a ,b ; double p ,q ; int main() { // freopen("C.in","r",stdin); // freopen(".out","w",stdout); int n=read(); b[0]=a[n+1]=0; a[0]=b[n+1]=1; For(i,n) cin>>b[i]; For(i,n) cin>>a[i]; ForD(i,n-1) a[i]+=a[i+1]; //P(min(a,b)>=i) Fork(i,2,n) b[i]+=b[i-1]; //P(max(a,b)<=i) For(i,n) { double c=1+b[i]-a[i+1],d=b[i]; double del=sqrt(abs(c*c-4*d)); double x1=(c+del)/2,x2=(c-del)/2; p[i]=x1,q[i]=x2; } For(i,n) printf("%.10lf ",p[i]-p[i-1]);puts(""); For(i,n) printf("%.10lf ",q[i]-q[i-1]); return 0; }
相关文章推荐
- gradle升级更新
- App引导界面,可以这么玩
- Android在Activity中启动一个新进程报错:Can't create handler inside thread that has not called Looper.prepare()。
- latex的一些编译问题--表格--页眉页脚
- 机电传动控制大作业——机械大楼电梯控制项目第一阶段
- MJExtension使用详解
- Linux下网卡eth1如何修改为eth0
- [LeetCode]Next Permutation下一个排列问题
- 第一篇博客
- 330. Patching Array
- javascript: 基于原型的面向对象编程
- spring 依赖注入DI-个人学习笔记
- datalab 数据表示实验
- Javascript中的自执行匿名函数
- CodeForces 567D One-Dimensional Battle Ships
- MAC下apache+php
- android源码解析(十七)-->Activity布局加载流程
- 求方程的近似解
- Android 单元测试--系列一
- 日志收集之kafka