HDU1224 Free DIY Tour(最短路变形,最长路打印路径,spfa)
来源:互联网 发布:逗屋网络 编辑:程序博客网 时间:2024/05/22 13:45
题目:
Free DIY Tour
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7000 Accepted Submission(s): 2295
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 andN+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 andN+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
Author
JGShining(极光炫影)
Source
杭州电子科技大学第三届程序设计大赛
Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1227 1080 1300 1024 1081
思路:这题的意思给你了n个点的一个权值,然后1点和n+1点的权值是0,然后他想获得最大的权值,那么spfa跑一遍最长路,记录路径就行
代码:
#include <cstdio>#include <cstring>#include <cctype>#include <string>#include <set>#include <iostream>#include <stack>#include <cmath>#include <queue>#include <vector>#include <algorithm>#define mem(a,b) memset(a,b,sizeof(a))#define inf 0x3f3f3f3f3f3f3f3f#define mod 1000007#define N 110#define M 100000+50#define ll long longusing namespace std;int n,m,t;int num[N],path[N],dis[N];int map[N][N],vis[N][N];void spfa(){for(int i=1; i<=n+1; i++){dis[i]=0;path[i]=0;}queue<int>q;q.push(1);int st;while(!q.empty()){st=q.front();q.pop();for(int i=1; i<=n+1; i++){if(vis[st][i]!=0){if(dis[st]+num[i]>dis[i]){dis[i]=dis[st]+num[i];path[i]=st;q.push(i);}}}}}int main(){int x,y,q=1;scanf("%d",&t);while(t--){mem(vis,0);scanf("%d",&n);for(int i=1; i<=n; i++)scanf("%d",&num[i]);num[n+1]=0;scanf("%d",&m);mem(vis,0);for(int i=1; i<=m; i++){scanf("%d%d",&x,&y);vis[x][y]=1;}spfa();if(q!=1)puts("");printf("CASE %d#\n",q++);printf("points : %d\n",dis[n+1]);printf("circuit : ");int a[300];int cnt=1;int i=n+1;while(path[i]){a[cnt++]=path[i];i=path[i];}for(int i=cnt-1; i>=1; i--){printf("%d->",a[i]);}printf("1\n");}return 0;}
阅读全文
0 0
- HDU1224 Free DIY Tour(最短路变形,最长路打印路径,spfa)
- HDU1224 Free DIY Tour(spfa+记录路径)
- HDU1224 Free DIY Tour 【SPFA】
- hdu1224 Free DIY Tour(最长路)
- HDU1224 Free DIY Tour(spfa+记录路径)
- 【dfs or 最短路】【HDU1224】【Free DIY Tour】
- hdu 1224 Free DIY Tour【SPFA最长路+输出路径】
- HDU1224 Free DIY Tour
- HDU1224 Free DIY Tour
- hdu1224 Free DIY Tour
- HDU1224-Free DIY Tour
- HUD 1224 Free DIY Tour(最短路spfa)
- hdu1224 Free DIY Tour--DP
- HDU 1224 Free DIY Tour SPFA最长路
- ZOJ3088 Easter Holidays spfa 最长路 最短路 路径打印
- hdu1224 Free DIY Tour(动态规划)
- hdu1224 Free DIY Tour (dp)
- hdu1224 Free DIY Tour DFS或者dp
- 《云计算架构技术与实践》读书笔记(五):Docker 容器及其调度
- Kafka入门经典教程
- Android Studio中使用JNI和第三方.so库
- 记Selenium HTMLTestRunner 无法生成测试报告的总结
- adapter
- HDU1224 Free DIY Tour(最短路变形,最长路打印路径,spfa)
- Windows 下安装composer
- 比特币源码学习笔记(一)
- ConcurrentModificationException的原因以及解决措施
- Shiro框架Realm及相关对象(六)
- ios开发中封装button同时显示图片和文字
- Git初识
- PAT 1021个位数统计
- xml解析之Dom4J