hdu 6201 transaction transaction transaction (spfa求最长路)
来源:互联网 发布:pinnacle临床数据采集 编辑:程序博客网 时间:2024/06/03 13:52
transaction transaction transaction
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 1518 Accepted Submission(s): 733
Problem Description
Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will read a book named "the Man Who Changed China". Of course, Kelukin wouldn't miss this chance to make money, but he doesn't have this book. So he has to choose two city to buy and sell.
As we know, the price of this book was different in each city. It isai yuan in i t city. Kelukin will take taxi, whose price is 1 yuan per km and this fare cannot be ignored.
There aren−1 roads connecting n cities. Kelukin can choose any city to start his travel. He want to know the maximum money he can get.
As we know, the price of this book was different in each city. It is
There are
Input
The first line contains an integer T (1≤T≤10 ) , the number of test cases.
For each test case:
first line contains an integern (2≤n≤100000 ) means the number of cities;
second line containsn numbers, the i th number means the prices in i th city; (1≤Price≤10000)
then followsn−1 lines, each contains three numbers x ,y and z which means there exists a road between x and y , the distance is z km (1≤z≤1000) .
For each test case:
first line contains an integer
second line contains
then follows
Output
For each test case, output a single number in a line: the maximum money he can get.
Sample Input
1 4 10 40 15 30 1 2 301 3 23 4 10
Sample Output
8
题意:
给你n个点书在当地的价格,以及两个点之间距离的花费,问你求选两个点使的利润最大
解析:
新建两个点,一个源点,一个汇点,再用spfa求最长路
#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<queue>using namespace std;const int MAXN = 500010 ;const int INF = 2000;typedef struct node{int u;int v;int value;int next;}node;node edge[MAXN];int head[MAXN],cnt,n;int d[MAXN],visit[MAXN];void addedge(int u,int v,int value){edge[cnt].u=u;edge[cnt].v=v;edge[cnt].value=value;edge[cnt].next=head[u];head[u]=cnt++;}void spfa(int s,int e){queue<int> mq;mq.push(s);visit[s]=1;d[s]=0;while(!mq.empty()){int tmp=mq.front();mq.pop();for(int i=head[tmp];i!=-1;i=edge[i].next){int v=edge[i].v;int value=edge[i].value;if(d[v]<d[tmp]+value){d[v]=d[tmp]+value;if(!visit[v]){mq.push(v);visit[v]=1;}}}visit[tmp]=0;}}int main(){int t;scanf("%d",&t);while(t--){memset(head,-1,sizeof(head));cnt=0;scanf("%d",&n);int a,b,c;for(int i=1;i<=n;i++){scanf("%d",&b);addedge(0,i,-b);addedge(i,n+1,b);}for(int i=1;i<=n-1;i++){scanf("%d%d%d",&a,&b,&c);addedge(a,b,-c);addedge(b,a,-c);}memset(visit,0,sizeof(visit));for(int i=0;i<=n+1;i++)d[i]=-INF;spfa(0,n+1);printf("%d\n",d[n+1]);}}
阅读全文
0 0
- hdu 6201 transaction transaction transaction (spfa求最长路)
- HDU 6201 transaction transaction transaction【树形DP||SPFA最长路】
- Hdu 6201 transaction transaction transaction【最长路】
- HDU 6201 transaction transaction transaction(SPFA算法求最长路径)
- hdu 6201 transaction transaction transaction(最长路)
- HDU 6201 transaction transaction transaction (最长路)
- Hdu 6201 transaction transaction transaction(最长路)
- hdu 6201transaction transaction transaction
- HDU 6201 transaction transaction transaction
- hdu 6201 transaction transaction transaction
- HDU 6201 transaction transaction transaction
- hdu-6201 transaction transaction transaction
- hdu 6201 transaction transaction transaction
- 【最短路 spfa && 水题】hdu-6201 transaction transaction transaction
- HDU 6201 transaction transaction transaction(SPFA模板)
- 【建图+spfa算法】transaction transaction transaction HDU
- transaction transaction transaction HDU
- transaction transaction transaction HDU
- 记录一个常用设计模式的理解
- JDK源码分析--多线程同步工具CountDownLatch类
- 存储过程详解
- visual studio code and unity||mac 下使用visual studio 调试unity代码
- 各种检验总结
- hdu 6201 transaction transaction transaction (spfa求最长路)
- 序列化和反序列化
- poj3463 Sightseeing(最短路,次短路计数)
- 日记模板
- 大数据学习13:Hive的DML整理,查询走MapReduce还是走Fetch
- 数组(2)-数组越界
- windbg常用查看设备command
- 【分享】快速上传ipa文件到iTunes Connect
- android 一键锁屏/更改密码/恢复出厂设置