标签:des style blog http color os io strong
题目链接:http://poj.org/problem?id=1062
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 36799 | Accepted: 10616 |
Description
Input
Output
Sample Input
1 4 10000 3 2 2 8000 3 5000 1000 2 1 4 200 3000 2 1 4 200 50 2 0
Sample Output
5250
Source
1 #include <iostream> 2 #include <cstdio> 3 using namespace std; 4 int vis[105],map[105][105],node[105],Min,n,w; 5 const int INF=99999999; 6 7 int dijkstra() 8 { 9 for(int i=1; i<=n; i++) 10 { 11 node[i]=map[0][i]; 12 } 13 for (int k=1; k<=n; k++) 14 { 15 Min=INF; 16 for (int i=1; i<=n; i++) 17 if (!vis[i]) 18 { 19 if (Min>node[i]) 20 { 21 Min=node[i]; 22 w=i; 23 } 24 } 25 vis[w]=1; 26 for (int i=1; i<=n; i++) 27 if (!vis[i]) 28 if (node[i]>map[w][i]+node[w]) 29 node[i]=map[w][i]+node[w]; 30 31 } 32 return node[1]; 33 } 34 35 int main () 36 { 37 int m,l[105]; 38 while (cin>>m>>n) 39 { 40 for (int i=1; i<=n; i++) 41 { 42 node[i]=INF; 43 for (int j=1; j<=n; j++) 44 map[i][j]=INF; 45 } 46 int MM=INF; 47 for (int i=1; i<=n; i++) 48 { 49 int p,x; 50 cin>>p>>l[i]>>x; 51 while (x--) 52 { 53 int t,v; 54 cin>>t>>v; 55 map[t][i]=v; 56 } 57 map[0][i]=p; 58 } 59 for (int i=1; i<=n; i++) 60 { 61 int lv=l[i]; 62 //l[i]+m l[i] 63 for (int j=1; j<=n; j++) 64 { 65 if (l[j]>=lv&&l[j]<=lv+m) 66 vis[j]=0; 67 else 68 vis[j]=1; 69 } 70 int s=dijkstra(); 71 MM=min(s,MM); 72 } 73 printf ("%d\n",MM); 74 } 75 return 0; 76 }
poj 1062 昂贵的聘礼 (dijkstra最短路),布布扣,bubuko.com
标签:des style blog http color os io strong
原文地址:http://www.cnblogs.com/qq-star/p/3921409.html