Poj1062_Dijkstra算法

一道求最小路径的题目，可以使用Dijkstra算法。一开始理解错了题目意思，以为是两个人之间等级差不能过大，即两个点之间等级差不能过大；题目原意是所有涉及交易的人的等级差在一个范围内，即最小路上的所有点的等级在一个范围内。理解了以后，由于等级差不可能会很大，所以只需要枚举出所有范围，再求每个范围的最小路径即可

//#define LOCAL
#include<cstdio>
#include<string.h>
#include<limits.h>
#include<stdlib.h>
using namespace std;

int main() {
#ifdef LOCAL
	freopen("data.in", "r", stdin);
#endif // !LOCAL
	int goods[110][4];
	int alter[1100][3];
	int m, n;
	scanf("%d%d", &m, &n);
	int count = 0;
	int nn = 1;

	while (scanf("%d%d%d", &goods[nn][1], &goods[nn][2], &goods[nn][3]) == 3) {
		for (int j = 1; j <= goods[nn][3]; j++) {
			count++;
			scanf("%d%d", &alter[count][1], &alter[count][2]);
		}
		nn++;
	}
	
	int money[110][110];
	for (int i = 1; i <= 100; i++) {
		for (int j = 1; j <= 100; j++) {
			money[i][j] = INT_MAX;
		}
	}

	count = 0;
	for (int i = 1; i <= n; i++) {

		for (int j = 1; j <= goods[i][3]; j++) {
			count++;
			money[i][alter[count][1]] = alter[count][2];
			
		}
	}

	int stand = goods[1][2];
	int cc = 0;
	int lala[100];//保存每一次枚举时得到的最小值
	for (int x = stand - m; x <= stand; x++) {//开始m次循环枚举
		//每一次循环都对在等级范围内的点使用Dijkstra算法
		
		int a[110];//用来存储从1到某个点的最小值
		int ifok[110];//某个点是否需要访问
		a[1] = 0;
		for (int i = 2; i <= n; i++) {
			if (goods[i][2] < x || goods[i][2] > x + m) {
				a[i] = INT_MAX;
				ifok[i] = 1;
			}
			else {
				a[i] = money[1][i];
				ifok[i] = 0;
			}
		}//对于每一次的枚举，如果某个点没在范围之内，将其设置为不用访问，值

		ifok[1] = 1;
		int ok = 1;
		while (ok < n) {
			int min = INT_MAX;
			int match = 1;
			for (int i = 2; i <= n; i++) {
				if (ifok[i] == 1) {
					continue;
				}
				if (a[i] < min) {
					min = a[i];
					match = i;
				}
			}//找出这一次循环中距离原点最近的点

			for (int i = 2; i <= n; i++) {
				if (i == match)
					continue;
				if (ifok[i] == 1)
					continue;
				if (money[match][i] != INT_MAX) {
					if (a[i] > a[match] + money[match][i]) {
						a[i] = a[match] + money[match][i];
					}
				}
			}

			ifok[match] = 1;
			ok++;
		}

		for (int i = 1; i <= n; i++) {
			if (a[i] != INT_MAX)
				a[i] = a[i] + goods[i][1];
		}
		int min = INT_MAX;
		for (int i = 1; i <= n; i++) {
			if (a[i] < min) {
				min = a[i];
			}
		}
		cc++;
		lala[cc] = min;
	}

	int mmin = INT_MAX;
	for (int i = 1; i <= cc; i++) {
		if (lala[i] < mmin)
			mmin = lala[i];
	}

	printf("%d\n", mmin);

	return 0;
}