隐马尔可夫模型介绍见这里：点击打开链接

Peter‘s Hobby

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Problem Description

Recently, Peter likes to measure the humidity of leaves. He recorded a leaf humidity every day. There are four types of leaves wetness: Dry , Dryish , Damp and Soggy. As we know, the humidity of leaves is affected by the weather. And there are only three kinds
of weather: Sunny, Cloudy and Rainy.For example, under Sunny conditions, the possibility of leaves are dry is 0.6.

Give you the possibility list of weather to the humidity of leaves.

The weather today is affected by the weather yesterday. For example, if yesterday is Sunny, the possibility of today cloudy is 0.375.

The relationship between weather today and weather yesterday is following by table:

Now,Peter has some recodes of the humidity of leaves in N days.And we know the weather conditons on the first day : the probability of sunny is 0.63,the probability of cloudy is 0.17,the probability of rainny is 0.2.Could you know the weathers of these days
most probably like in order?

Input

The first line is T, means the number of cases, then the followings are T cases. for each case:

The first line is a integer n(n<=50),means the number of days, and the next n lines, each line is a string shows the humidity of leaves (Dry, Dryish, Damp, Soggy)

Output

For each test case, print the case number on its own line. Then is the most possible weather sequence.( We guarantee that the data has a unique solution)

Sample Input

1
3
Dry
Damp
Soggy

Sample Output

Case #1:
Sunny
Cloudy
Rainy

Hint

Log is useful.

Author

FZU

Source

2014 Multi-University Training Contest 1

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

int n;

double lea[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 wea[3][3]=
{
	{0.5,0.375,0.125},
	{0.25,0.125,0.625},
	{0.25,0.375,0.375}
};

int ord[100],pre[100][100];
double dp[100][100];

void output(int day,int weather)
{
	if(day<0) return;
	output(day-1,pre[day][weather]);
	//cout<<"day: "<<day<<" weather: "<<weather<<endl;
	if(weather==0)
		puts("Sunny");
	else if(weather==1)
		puts("Cloudy");
	else if(weather==2)
		puts("Rainy");
}

int main()
{
	int T_T,cas=1;
	scanf("%d",&T_T);
	for(int i=0;i<3;i++)
	{
		for(int j=0;j<4;j++)
		{
			lea[i][j]=log(lea[i][j]);
			if(j<3)
				wea[i][j]=log(wea[i][j]);
		}
	}
while(T_T--)
{
	scanf("%d",&n);
	memset(dp,0,sizeof(dp));
	memset(pre,0,sizeof(pre));
	char leaf[20];
	for(int i=0;i<n;i++)
	{
		scanf("%s",leaf);
		if(strcmp(leaf,"Dry")==0)
			ord[i]=0;
		else if(strcmp(leaf,"Dryish")==0)
			ord[i]=1;
		else if(strcmp(leaf,"Damp")==0)
			ord[i]=2;
		else ord[i]=3;
	}
	dp[0][0]=log(0.63)+lea[0][ord[0]];
	dp[0][1]=log(0.17)+lea[1][ord[0]];
	dp[0][2]=log(0.2)+lea[2][ord[0]];
	for(int i=1;i<n;i++)
	{
		for(int j=0;j<3;j++)
		{
			double mx=-1000000000;int mr=-1;
			for(int k=0;k<3;k++)
			{
				double temp=dp[i-1][k]+wea[k][j]+lea[j][ord[i]];
				if(temp>mx)
				{
					mx=temp; mr=k;
				}
			}
			dp[i][j]=mx; pre[i][j]=mr;
		}
	}
	double mx=-1000000000;int mr=-1;
	for(int i=0;i<3;i++)
	{
		if(mx<dp[n-1][i])
		{
			mr=i;
			mx=dp[n-1][i];
		}
	}
	printf("Case #%d:\n",cas++);
	output(n-1,mr);
}
	return 0;
}

HDOJ 4865 Peter's Hobby