http://poj.org/problem?id=3071
Football
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 2377 Accepted: 1198
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
2
0.0 0.1 0.2 0.3
0.9 0.0 0.4 0.5
0.8 0.6 0.0 0.6
0.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:
P(2 wins) = P(2 beats 1)P(3 beats 4)P(2 beats 3) + P(2 beats 1)P(4 beats 3)P(2 beats 4)
= 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.
Source
Stanford Local 2006
解析:
题意:
给出1<<n支队伍,进行n轮比赛,为最后那支队伍胜出。
每轮比赛都是按照序号递增顺序两两对决,胜者才能进入下一轮比赛
思路:
1.比赛对决可以看做是一棵二叉树模型
2.dp[i][j]表示第i轮j号队伍胜出的概率
dp[i][j]=sum{dp[i-1][j]*p[j][k]*dp[i-1][k]}
3.其中k表示j可能遇到的对手,画出二叉树可得当((k<<(i-1))^1==j<<(i-1))时,k和j属于同一棵子树下,即k可能是j的对手
4.答案为在最后一局胜出概率最大的队伍的编号
79 MS 860 KB GNU C++
*/
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include <iostream>
using namespace std;
const int maxn=150;
double p[maxn][maxn];
double dp[8][maxn];
int main()
{
int n,i,j,k;
while(scanf("%d",&n)!=EOF)
{
if(n==-1)
break;
for(i=0;i<(1<<n);i++)
for(j=0;j<(1<<n);j++)
{
scanf("%lf",&p[i][j]);
}
for(i=0;i<(1<<n);i++)
{dp[0][i]=1;
}
for(i=1;i<=n;i++)
for(j=0;j<(1<<n);j++)
{
dp[i][j]=0;
for(k=0;k<(1<<n);k++)
if(((k>>(i-1))^1)==(j>>(i-1)))//这个判断是否属于同一个子树,直接套用了结论
dp[i][j]+=dp[i-1][j]*p[j][k]*dp[i-1][k];//与可能比赛的对手进行对决
}
double m=0;
int ans=0;
for(i=0;i<(1<<n);i++)
{
if(m<dp[n][i])
{
m=dp[n][i];
ans=i;
//printf("i==%d\n",i);
}
}
ans++;
printf("%d\n",ans);
}
//system("pause");
return 0;
}