HDU1224 Free DIY Tour 【SPFA】
来源:互联网 发布:远程桌面数据加密错误 编辑:程序博客网 时间:2024/05/01 23:07
Free DIY Tour
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3939 Accepted Submission(s): 1262
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 both1 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 both1 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
Author
JGShining(极光炫影)
Source
杭州电子科技大学第三届程序设计大赛
题意:等价于给定n个点以及m条有向边,求从起点到起点权值最大的圈。
题解:用SPFA每次更新各个点到起点的最大距离,直到无法更新为止。
#include <stdio.h>#include <string.h>#include <queue>#define maxn 102#define maxm (maxn * maxn) >> 1using std::queue;int city[maxn], head[maxn];int dist[maxn], pre[maxn];struct Node{int to, next;} E[maxm];bool vis[maxn];void SPFA(int n, int s){int i, u, v, tmp;for(i = 0; i <= n; ++i){dist[i] = 0; vis[i] = false;} dist[n + 1] = 0;vis[s] = true;queue<int> Q;Q.push(s);while(!Q.empty()){u = Q.front(); Q.pop();vis[u] = false;for(i = head[u]; i != -1; i = E[i].next){v = E[i].to;tmp = dist[u] + city[v];if(tmp > dist[v]){dist[v] = tmp;vis[v] = true;pre[v] = u;Q.push(v);}}}}void printPath(int k, int n){if(k == 1) return;printPath(pre[k], n);printf("->%d", k > n ? 1 : k);}int main(){int t, cas, n, i, m, u, v;scanf("%d", &t);for(cas = 1; cas <= t; ++cas){scanf("%d", &n);for(i = 1; i <= n; ++i){scanf("%d", &city[i]);}city[n + 1] = 0;scanf("%d", &m);memset(head, -1, sizeof(head));for(i = 0; i < m; ++i){scanf("%d%d", &u, &v);E[i].to = v; E[i].next = head[u];head[u] = i;}SPFA(n, 1);printf("CASE %d#\n", cas);printf("points : %d\n", dist[n + 1]);printf("circuit : 1");printPath(n + 1, n); printf("\n");if(cas != t) printf("\n");}return 0;}
0 0
- HDU1224 Free DIY Tour 【SPFA】
- HDU1224 Free DIY Tour(spfa+记录路径)
- HDU1224 Free DIY Tour
- HDU1224 Free DIY Tour
- hdu1224 Free DIY Tour
- HDU1224-Free DIY Tour
- HDU1224 Free DIY Tour(spfa+记录路径)
- hdu1224 Free DIY Tour--DP
- hdu1224 Free DIY Tour(动态规划)
- hdu1224 Free DIY Tour (dp)
- hdu1224 Free DIY Tour DFS或者dp
- hdu1224 Free DIY Tour 动态规划
- hdu1224 Free DIY Tour(最长路)
- hdu1224—Free DIY Tour(Bellman_Ford)
- 动态规划:HDU1224-Free DIY Tour
- hdu1224 Free DIY Tour【动态规划】
- HDU1224 Free DIY Tour(最短路变形,最长路打印路径,spfa)
- HDU1224--Free DIY Tour--广度优先搜索+剪枝
- 分页语句优化
- 关于java的视频资料分享
- 窗口抖动
- MakeFile基础知识(七)
- android实现下拉刷新上拉加载更多理解
- HDU1224 Free DIY Tour 【SPFA】
- hdu 1018 计算一个数阶乘的位数
- 理解别人的想法,感受他情绪的变化,水至清则无鱼
- cocos2d-x中各种动作和特效的详细解释
- Java 从网络上下载文件
- 2030年后的《异类》: 中国人口年龄构成统计 2007 - 2100
- 中国每年出生人口数 1976年 - 2000年 历年男女性别比
- linux gpio模拟i2c的使用/用GPIO模拟I2C总线-1 .
- OC_内存管理的原则