poj 3071 Football(线段树+概率)
来源:互联网 发布:网络相亲可信吗 编辑:程序博客网 时间:2024/05/16 12:19
Description
Consider a single-elimination football tournament involving 2n teams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tournament are placed in a list in order of increasing index. Then, the first team in the list plays the second team, the third team plays the fourth team, etc. The winners of these matches advance to the next round, and the losers are eliminated. After n rounds, only one team remains undefeated; this team is declared the winner.
Given a matrix P = [pij] such that pij is the probability that team i will beat team j in a match determine which team is most likely to win the tournament.
Input
The input test file will contain multiple test cases. Each test case will begin with a single line containing n (1 ≤ n ≤ 7). The next 2n lines each contain 2n values; here, the jth value on the ith line represents pij. The matrix P will satisfy the constraints that pij = 1.0 − pji for all i ≠ j, and pii = 0.0 for all i. The end-of-file is denoted by a single line containing the number −1. Note that each of the matrix entries in this problem is given as a floating-point value. To avoid precision problems, make sure that you use either the double
data type instead of float
.
Output
The output file should contain a single line for each test case indicating the number of the team most likely to win. To prevent floating-point precision issues, it is guaranteed that the difference in win probability for the top two teams will be at least 0.01.
Sample Input
20.0 0.1 0.2 0.30.9 0.0 0.4 0.50.8 0.6 0.0 0.60.7 0.5 0.4 0.0-1
Sample Output
2
Hint
In the test case above, teams 1 and 2 and teams 3 and 4 play against each other in the first round; the winners of each match then play to determine the winner of the tournament. The probability that team 2 wins the tournament in this case is:
= p21p34p23 + p21p43p24
= 0.9 · 0.6 · 0.4 + 0.9 · 0.4 · 0.5 = 0.396.
The next most likely team to win is team 3, with a 0.372 probability of winning the tournament.
每个节点记录这个区间每个队赢的概率。
#include <iostream>#include <cstdio>using namespace std;const int maxn = 200;const double eps = 0.0001;struct tree{ int l , r; double win[maxn];}a[4*maxn];double P[maxn][maxn];int N[10] = {1 , 2 , 4 , 8 , 16 , 32 , 64 , 128 , 256 , 512};int n;void initial(){ for(int i = 0; i < 4*maxn; i++){ for(int j = 0; j < maxn; j++){ a[i].win[j] = 0.0; } }}void build(int l , int r , int k){ a[k].l = l; a[k].r = r; if(l == r){ a[k].win[l] = 1.0; }else{ int mid = (l+r)/2; build(l , mid , 2*k); build(mid+1 , r , 2*k+1); int i = l; while(i <= mid){ for(int j = mid+1; j <= r; j++){ a[k].win[i] += a[2*k].win[i]*a[2*k+1].win[j]*P[i][j]; } i++; } while(i <= r){ for(int j = l; j <= mid; j++){ a[k].win[i] += a[2*k].win[j]*a[2*k+1].win[i]*P[i][j]; } i++; } }}void readcase(){ for(int i = 0; i < N[n]; i++){ for(int j = 0; j < N[n]; j++){ scanf("%lf" , &P[i][j]); } }}void computing(){ build(0 , N[n]-1 , 1); int ans = 0; for(int i = 1; i < N[n]; i++){ if(a[1].win[i] - a[1].win[ans] > eps){ ans = i; } } printf("%d\n" , ans+1);}int main(){ while(scanf("%d" , &n) && n != -1){ initial(); readcase(); computing(); } return 0;}
- poj 3071 Football(线段树+概率)
- poj 3071 Football (概率)
- POJ 3071 Football (概率DP)
- poj 3071 Football(概率dp)
- poj 3071 Football(概率dp)
- [ACM] POJ 3071 Football (概率DP)
- POJ 3071 Football(简单 概率DP)
- POJ 3071-Football(概率dp)
- poj 3071 Football (概率DP)
- POJ 3071 Football (概率dp)
- poj 3071 Football(概率dp)
- poj 3071 Football (概率 dp)
- poj 3071Football(概率dp)
- POJ 3071 Football(概率dp)
- POJ 3071 Football (概率DP)
- POJ 3071 Football(概率DP)
- POJ 3071 Football (概率DP)
- POJ-3071 Football (概率DP)
- SVN库迁移
- CentOS6.5的系统安装
- ASP.NET MVC Razor视图引擎攻略
- 博文博客推荐汇总
- 7-1 编程练习题答案
- poj 3071 Football(线段树+概率)
- 7-2 编程练习题答案
- 要主动发现任务
- 7-3 编程练习题答案
- html5开发手机打电话发短信功能,html5的高级开发,html5开发大全,html手机电话短信功能详解
- 用tinyxml 库创建并读写xml代码截取
- 7-4 编程练习题答案
- 关于递归
- 7-5 编程练习题答案