poj-3071

最新推荐文章于 2020-02-27 08:47:11 发布

fyfcauc

最新推荐文章于 2020-02-27 08:47:11 发布

阅读量375

点赞数

分类专栏： POJ DP 文章标签： poj

本文链接：https://blog.csdn.net/fyfcauc/article/details/39078225

版权

POJ 同时被 2 个专栏收录

233 篇文章 0 订阅

订阅专栏

22 篇文章 0 订阅

订阅专栏

//528K  94MS    G++ 
#include <cstdio>
#include <cstring>
#include <cmath>

const int MAX = 130;

double P[MAX][MAX];

double DP[MAX][9];

int N;
int teamNum;

void getVSId(int curTeamId, int winTime, int & beginVSId, int & endVsId) {
    int teamMemberCapcity = pow(2, winTime);
    beginVSId = 1;
    endVsId = beginVSId + teamMemberCapcity - 1;
    while(1) {
        if (curTeamId >= beginVSId && curTeamId <= endVsId) {
            break;
        } else {
            beginVSId = endVsId + 1;
            endVsId = beginVSId + teamMemberCapcity - 1;
        }
    }
    int middleId = (beginVSId + endVsId)>>1;
    if (curTeamId <= middleId) {
        beginVSId = middleId+1;
    } else {
        endVsId = middleId;
    }
    // printf("getVSId %d %d %d %d\n", curTeamId, winTime, beginVSId, endVsId);
}

void beginDP() {
    for (int winTime = 1; winTime <= N; winTime++) {
        for (int teamId = 1; teamId <= teamNum; teamId++) {
            if (winTime == 1) {
                if (teamId%2) { // is odd, VS teamId +1
                    DP[teamId][1] = P[teamId][teamId+1];
                } else { // is even, VS teamId -1
                    DP[teamId][1] = P[teamId][teamId-1];
                }
                // printf("DP %d %d %lf\n", teamId, 1, DP[teamId][1]);
            } else {
                int beginVSId;
                int endVsId;
                getVSId(teamId, winTime, beginVSId, endVsId);
                double tmp = 0.0;

                for (int i = beginVSId; i <= endVsId; i++) {
                    tmp += DP[i][winTime-1]*P[teamId][i];
                    // // printf("%lf %lf %lf %lf\n",
                    //     // DP[i][winTime-1], P[teamId][i],
                    //     DP[i][winTime-1]*P[teamId][i], tmp);
                }
                DP[teamId][winTime] = tmp*DP[teamId][winTime-1];
                // printf("DP %d %d %lf %d %d\n", teamId, winTime, DP[teamId][winTime], beginVSId, endVsId);
            }
        }
    }
}

void getMostPossibleWinner() {
    beginDP();
    int winnerId = 0;
    double maxP = 0.0;
    for (int i = 1; i<= teamNum; i++) {
        if (maxP < DP[i][N]) {
            maxP = DP[i][N];
            winnerId = i;
        }
    }
    // printf("%d %lf\n", winnerId, maxP);
    printf("%d\n", winnerId);
}

int main() {
    while(scanf("%d", &N) != EOF) {
        if (N == -1) {
            return 0;
        }
        teamNum = pow(2, N);
        memset(P, 0, sizeof(P));
        memset(DP, 0, sizeof(DP));
        for (int i = 1; i <= teamNum; ++i) {
            for (int j = 1; j <= teamNum; ++j) {
                double Pij;
                scanf("%lf", &Pij);
                P[i][j] = Pij;
            }
        }
        getMostPossibleWinner();
    }
}

披着概率外衣的DP基础题，在写getVsID时犯了个低级错误.

题目咋一看比较唬人，不过结合着例子分析一下，DP的关系就出来了：

首先，题目指明了，比赛的对手安排：

1对2， 3对4 ...... N-1对N.

那么，对于1来说，赢一场的概率就是 P(1,2)（1击败2的概率）

而对于第二轮比赛，按照题目的规定，

1的选手只能是 3或者4，那么赢得概率就是 P(1,2)( P(1,3)*P(3,4) + P(1,4)*P(4,3) )

就这样递推，会发现，

某个选手i，赢得N场比赛的概率DP[i][N]可以这样表示：

DP[i][N-1] （DP[A1][N-1]P(i,A1) + DP[A2][N-1]P(i,A3) + ... + DP[AN][N-1]P(i,AN)）（A1... AN是 i在第N场比赛中可能遭遇的对手），

那么如何确定A1....AN，可以观察发现：

对于1来说，第一场比赛的对手只可能是2，