hdu1224—Free DIY Tour(Bellman_Ford)
来源:互联网 发布:手机看本子的软件 编辑:程序博客网 时间:2024/05/22 13:55
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1224
Free DIY Tour
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6769 Accepted Submission(s): 2209
Problem Description
Weiwei is a software engineer of ShiningSoft. He has just excellently fulfilled a software project with his fellow workers. His boss is so satisfied with their job that he decide to provide them a free tour around the world. It's a good chance to relax themselves. To most of them, it's the first time to go abroad so they decide to make a collective tour.
The tour company shows them a new kind of tour circuit - DIY circuit. Each circuit contains some cities which can be selected by tourists themselves. According to the company's statistic, each city has its own interesting point. For instance, Paris has its interesting point of 90, New York has its interesting point of 70, ect. Not any two cities in the world have straight flight so the tour company provide a map to tell its tourists whether they can got a straight flight between any two cities on the map. In order to fly back, the company has made it impossible to make a circle-flight on the half way, using the cities on the map. That is, they marked each city on the map with one number, a city with higher number has no straight flight to a city with lower number.
Note: Weiwei always starts from Hangzhou(in this problem, we assume Hangzhou is always the first city and also the last city, so we mark Hangzhou both 1 and N+1), and its interesting point is always 0.
Now as the leader of the team, Weiwei wants to make a tour as interesting as possible. If you were Weiwei, how did you DIY it?
The tour company shows them a new kind of tour circuit - DIY circuit. Each circuit contains some cities which can be selected by tourists themselves. According to the company's statistic, each city has its own interesting point. For instance, Paris has its interesting point of 90, New York has its interesting point of 70, ect. Not any two cities in the world have straight flight so the tour company provide a map to tell its tourists whether they can got a straight flight between any two cities on the map. In order to fly back, the company has made it impossible to make a circle-flight on the half way, using the cities on the map. That is, they marked each city on the map with one number, a city with higher number has no straight flight to a city with lower number.
Note: Weiwei always starts from Hangzhou(in this problem, we assume Hangzhou is always the first city and also the last city, so we mark Hangzhou both 1 and N+1), and its interesting point is always 0.
Now as the leader of the team, Weiwei wants to make a tour as interesting as possible. If you were Weiwei, how did you DIY it?
Input
The input will contain several cases. The first line is an integer T which suggests the number of cases. Then T cases follows.
Each case will begin with an integer N(2 ≤ N ≤ 100) which is the number of cities on the map.
Then N integers follows, representing the interesting point list of the cities.
And then it is an integer M followed by M pairs of integers [Ai, Bi] (1 ≤ i ≤ M). Each pair of [Ai, Bi] indicates that a straight flight is available from City Ai to City Bi.
Each case will begin with an integer N(2 ≤ N ≤ 100) which is the number of cities on the map.
Then N integers follows, representing the interesting point list of the cities.
And then it is an integer M followed by M pairs of integers [Ai, Bi] (1 ≤ i ≤ M). Each pair of [Ai, Bi] indicates that a straight flight is available from City Ai to City Bi.
Output
For each case, your task is to output the maximal summation of interesting points Weiwei and his fellow workers can get through optimal DIYing and the optimal circuit. The format is as the sample. You may assume that there is only one optimal circuit.
Output a blank line between two cases.
Output a blank line between two cases.
Sample Input
230 70 9041 21 32 43 430 90 7041 21 32 43 4
Sample Output
CASE 1#points : 90circuit : 1->3->1CASE 2#points : 90circuit : 1->2->1
题目大意:给你一张图,求s点到e点的最长路径
解题思路:最短路模板(用Bellman_Ford写的)
#include <cstdio> #include <cstring> #include <cmath> #include <iostream> #include <queue>#include <set>#include <string>#include <stack>#include <algorithm>#include <map>using namespace std; typedef long long ull;const int N = 108;const int M = 50800;const int INF = 0x3fffffff;const double Pi = acos(-1.0);struct edge{int u,v,w;}e[N*N];int dist[N],tick[N],rec[N],Ecnt;void mkEdge( int a , int b , int c ){e[Ecnt].u = a;e[Ecnt].v = b;e[Ecnt].w = c;++Ecnt;}void Bellman_Ford(int n){fill( dist , dist+N , 0 );tick[1] = 1;for( int i = 0 ; i < n-1 ; ++i ){for( int j = 0 ; j < Ecnt ; ++j ){int u = e[j].u;int v = e[j].v;int w = e[j].w;if( dist[v] < dist[u]+w ){dist[v] = dist[u]+w;tick[v] = u;}}}}int main(){int T,tot=0;scanf("%d",&T);while( T-- ){Ecnt = 0;int n,m,a,b;scanf("%d",&n);for( int i = 1 ; i <= n ; ++i ){scanf("%d",&rec[i]);}rec[n+1] = 0;scanf("%d",&m);for( int i = 0 ; i < m ; ++i ){scanf("%d%d",&a,&b);if( a > b ) swap(a,b);mkEdge(a,b,rec[b]);}Bellman_Ford(n+1);int re[N],cnt=0;re[cnt++] = 1;for( int i = tick[n+1] ; i != tick[i] ; i = tick[i] ){re[cnt++] = i;}if( tot ) printf("\n");printf("CASE %d#\n",++tot);printf("points : %d\n",dist[n+1]);printf("circuit : 1");for( int i = cnt-1 ; i >= 0 ; --i ){printf("->%d",re[i]);}printf("\n");}return 0;}
阅读全文
0 0
- hdu1224—Free DIY Tour(Bellman_Ford)
- HDU1224 Free DIY Tour
- HDU1224 Free DIY Tour
- hdu1224 Free DIY Tour
- HDU1224-Free DIY Tour
- hdu1224 Free DIY Tour (dp)
- hdu1224 Free DIY Tour(最长路)
- HDU1224 Free DIY Tour 【SPFA】
- hdu1224 Free DIY Tour--DP
- HDU1224 Free DIY Tour(spfa+记录路径)
- hdu1224 Free DIY Tour(动态规划)
- HDU1224 Free DIY Tour(spfa+记录路径)
- hdu1224 Free DIY Tour DFS或者dp
- hdu1224 Free DIY Tour 动态规划
- 动态规划:HDU1224-Free DIY Tour
- hdu1224 Free DIY Tour【动态规划】
- HDU1224--Free DIY Tour--广度优先搜索+剪枝
- 【dfs or 最短路】【HDU1224】【Free DIY Tour】
- webrtc视频采集模块
- 总结string-escape和unicode-escape
- Python希尔排序算法
- 试用Embarcadero® RAD Studio 10.2
- 【Spring】普通bean、FactoryBean、BeanFactory的区别与联系
- hdu1224—Free DIY Tour(Bellman_Ford)
- 《UNIX网络编程 卷1》 笔记: 非阻塞式I/O
- OpenGL 入门基础教程 —— 基本术语篇【1】
- VS部署发布失败解决方法
- angularJs中$scope数据序列化
- 读书好多读书读好书(技巧题,水)
- 利用scrapy爬取新浪体育新闻的小例子
- restfun_api设计指南
- 安装测试facebook FAISS(CPU)