2017 ACM/ICPC Asia Regional Shenyang Onlin 1008
来源:互联网 发布:华泰交易软件下载 编辑:程序博客网 时间:2024/05/22 14:19
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真的是一道很好的题.可以用网络流,最短路,树形DP等方法解决.DP不会.所以用那两个。最简单的就是最短路思想. 建立一个源点,指向所有的城市,边权为书费. 之后求最长路,对于源点到所有点的最长路减去每个城市的卖假,求最大值即可。我不知道为什么,我建立一个汇点,就会超时.可能是建立汇点会多遍历太多的边吧
阅读全文
0 0
- 2017 ACM/ICPC Asia Regional Shenyang Onlin 1008
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional shenyang Online
- Problem 1002-2017 ACM/ICPC Asia Regional Shenyang Online
- Problem 1004-2017 ACM/ICPC Asia Regional Shenyang Online
- [尺取法]2017 ACM/ICPC Asia Regional Shenyang Online 1012
- 2017 ACM/ICPC Asia Regional Shenyang Online:number number number
- 2017 ACM/ICPC Asia Regional Shenyang Online:transaction transaction transaction
- 2017 ACM/ICPC Asia Regional Shenyang Online 1012 card
- 2017 ACM/ICPC Asia Regional Shenyang Online transaction
- 2017 ACM/ICPC Asia Regional Shenyang Online card
- 2017 ACM/ICPC Asia Regional Shenyang Online array
- 广播接收器BroadcastReceiver,无序、有序、本地几种广播
- iOS自定义转场动画
- python之禅
- 移动web应用调试汇总
- VAE(Variational Autoencoder)的原理
- 2017 ACM/ICPC Asia Regional Shenyang Onlin 1008
- 词向量源码解析:(4.2)hyperwords源码解析之corpus2pairs等
- 安装 lodash
- 深入了解Windows句柄到底是什么
- ###Jsp+Servlet购物商城day03.2:生成订单。重点笔记
- 详谈Java设计模式之原型(Prototype)模式
- php支付宝支付,退款,回调函数
- Android视频音乐播放SeekBar和播放时间同步
- VMWare虚拟机设置固定IP上网方法