URAL 1210 Kind Spirits (DP动态规划)

tiutiu2011

于 2015-09-21 16:17:38 发布

阅读量462

点赞数

CC 4.0 BY-SA版权

分类专栏： Talk is cheap Show me the code ACM-ICPC 文章标签： URAL 1210 Kind Spirits DP 动态规划

本文链接：https://blog.youkuaiyun.com/tiutiu2011/article/details/48628031

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章

订阅专栏

ACM-ICPC

154 篇文章

订阅专栏

本文提供了一个使用C语言实现的动态规划示例程序，该程序通过读取输入来计算到达每个星球的最低费用，展示了如何运用动态规划解决多阶段决策问题。

#include <stdio.h>
#define MAX_LEVELS 30
#define MAX_PLANETS 31
#define MAX_PAY 1e7

int numOfLevels;
int minPay[MAX_LEVELS][MAX_PLANETS];

int main(){

	scanf("%d", &numOfLevels);
	int level;
	for (level = 1; level <= numOfLevels; level++){
		int preLevel = level - 1;
		int numOfPlanets;
		scanf("%d", &numOfPlanets);
		int planet;
		for (planet = 1; planet <= numOfPlanets; planet++){
			minPay[level][planet] = MAX_PAY;
			int from;
			while (scanf("%d", &from) != EOF && from != 0){
				int pay;
				scanf("%d", &pay);	
				//每输入一个数据即刻DP
				if (minPay[preLevel][from] + pay < minPay[level][planet])
					minPay[level][planet] = minPay[preLevel][from] + pay;
			}
		}
		//注意如何处理'*'的输入问题
		char str[2];
		if (level < numOfLevels)
			scanf("%s", str);
		else {
			int result = MAX_PAY;
			for (planet = 1; planet <= numOfPlanets; planet++)
				if (minPay[level][planet] < result)
					result = minPay[level][planet];
			printf("%d\n", result);
		}

	}

	return 0;
}