HDU 4856 DP

2014 Multi-University Training Contest 1

DP存每天的三种天气的概率，最后从最后一天再退回去即可

#include "stdio.h"
#include "string.h"
double pro1[3][4]={0.6,0.2,0.15,0.05,0.25,0.3,0.2,0.25,0.05,0.1,0.35,0.5};
double pro2[3][3]={0.5,0.375,0.125,0.25,0.125,0.625,0.25,0.375,0.375};
double dp[51][4];
int ans[51],day[51],mark[51][4],n;
void solve(int x,int y)
{
    double a,b,c;
    a=dp[x-1][0]*pro2[0][y]*pro1[y][day[x]];
    b=dp[x-1][1]*pro2[1][y]*pro1[y][day[x]];
    c=dp[x-1][2]*pro2[2][y]*pro1[y][day[x]];
    if (a>=b && a>=c)
    dp[x][y]=a,mark[x][y]=0;
    if(b>=a && b>=c)
    dp[x][y]=b,mark[x][y]=1;
    if (c>=a && c>=b)
    dp[x][y]=c,mark[x][y]=2;
}
void pri()
{
    int i,x;
    x=0;
    for (i=0;i<3;i++)
    if (dp[n][i]>dp[n][x]) x=i;
    ans[n]=x;
    for (i=n-1;i>=1;i--)
    x=mark[i+1][x],ans[i]=x;
    for (i=1;i<=n;i++)
    if (ans[i]==0)   printf("Sunny\n");
    else if(ans[i]==1) printf("Cloudy\n");
    else if(ans[i]==2) printf("Rainy\n");
}
int main()
{
    char str[7];
    int Case,ii,i;
    scanf("%d",&Case);
    for (ii=1;ii<=Case;ii++)
    {
        scanf("%d",&n);
        for (i=1;i<=n;i++)
        {
            scanf("%s",str);
            if (strcmp("Dry",str)==0) day[i]=0;
            if (strcmp("Dryish",str)==0) day[i]=1;
            if (strcmp("Damp",str)==0) day[i]=2;
            if (strcmp("Soggy",str)==0) day[i]=3;
        }

        memset(dp,0,sizeof(dp));
        dp[1][0]=0.63*pro1[0][day[1]];
        dp[1][1]=0.17*pro1[1][day[1]];
        dp[1][2]=0.2*pro1[2][day[1]];
        for (i=2;i<=n;i++)
        {
            solve(i,0);
            solve(i,1);
            solve(i,2);
        }
        printf("Case #%d:\n",ii);
        pri();
    }
    return 0;
}