C - Heavy Transportation——HOJ
2016-04-29 23:41
225 查看
C - Heavy Transportation
Time Limit:3000MS Memory Limit:30000KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Background
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed
on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.
Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo's place) to crossing n (the customer's
place). You may assume that there is at least one path. All streets can be travelled in both directions.
Input
The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing
of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.
Output
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for
the scenario with a blank line.
Sample Input
Sample Output
最大生产树:
prime 算法 基于贪心思想!!
Time Limit:3000MS Memory Limit:30000KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Background
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed
on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.
Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo's place) to crossing n (the customer's
place). You may assume that there is at least one path. All streets can be travelled in both directions.
Input
The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing
of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.
Output
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for
the scenario with a blank line.
Sample Input
1 3 3 1 2 3 1 3 4 2 3 5
Sample Output
Scenario #1: 4
最大生产树:
#include<stdio.h> #include<string.h> #include<math.h> int my_max(int x,int y); int e[2005][2005]; long inf=999999; long num; int book[2001]; long dis[2001]; int main() { int i,j,k,n,t,v,u,w,time,max,maxx,min; scanf("%ld",&num); for(time=1;time<=num;time++) { memset(e,0,sizeof(e)); memset(book,0,sizeof(book)); memset(dis,0,sizeof(dis)); scanf("%d %d",&n,&t); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { if(i==j) e[i][j]=0; else e[i][j]=-inf; } } for(i=1;i<=t;i++) { scanf("%d %d %d",&v,&u,&w);//有可能出现重复的边 e[v][u]=my_max(e[v][u],w); e[u][v]=e[v][u]; } for(i=1;i<=n;i++) { dis[i]=e[1][i]; } book[1]=1; max=-1; min=inf; for(j=1;j<=n;j++) { max=-1;maxx=0; for(i=1;i<=n;i++) { if(max<dis[i]&&book[i]==0) { max=dis[i]; maxx=i; } } book[maxx]=1; if(max<min) min=max; if(maxx==n) break; for(i=1;i<=n;i++) { if(book[i]==0) { if(dis[i]<e[maxx][i])//最大生成树与最小生成树的区别!!!!! dis[i]=e[maxx][i]; } } } printf("Scenario #%d:\n",time); printf("%ld\n",min); printf("\n"); } return 0; } int my_max(int x,int y) { if(x>y) return x; else return y; }
prime 算法 基于贪心思想!!
相关文章推荐
- Reverse Nodes in k-Group
- Vsftpd支持SSL加密传输
- u-boot.lds文件诠释
- zoj 2342 Roads
- Generate Parentheses 生成括号-- LintCode题解
- Spring JDBC常用方法详细示例
- POJ-2533 Longest Ordered Subsequence ( DP )
- 机器学习矩阵求导
- NYOJ吝啬的国度(搜索)
- opacity属性的应用
- Junit中Parametorized runner 的用法
- Image Classification: Data-driven Approach, k-Nearest Neighbor, train/val/test splits
- node.js之this的困惑
- (35)Spring Boot集成Redis实现缓存机制【从零开始学Spring Boot】
- POJ 3101 素数分解+大数
- 【VC++技术杂谈005】如何与程控仪器通过GPIB接口进行通信
- HTML页面内块级元素内折行显示
- binary-tree-preorder-traversal(二叉树的前序遍历)
- Leetcode #59. Spiral Matrix ii 螺旋遍历2 解题报告
- linux下配置opencv