2017 ACM/ICPC Asia Regional Shenyang Onlin 1008

100 阅读 0 评论 66 点赞

我是靠谱客的博主激情歌曲，最近开发中收集的这篇文章主要介绍2017 ACM/ICPC Asia Regional Shenyang Onlin 1008，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

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 is

yuan in

t city. Kelukin will take taxi, whose price is

yuan per km and this fare cannot be ignored.
There are

n−1 roads connecting

n cities. Kelukin can choose any city to start his travel. He want to know the maximum money he can get.

Input

The first line contains an integer

T (

1≤T≤10 ) , the number of test cases.
For each test case:
first line contains an integer

n (

2≤n≤100000 ) means the number of cities;
second line contains

n numbers, the

th number means the prices in

th city;

(1≤Price≤10000)
then follows

n−1 lines, each contains three numbers

x ,

y and

z which means there exists a road between

x and

y , the distance is

(1≤z≤1000) .

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 30
1 3 2
3 4 10

Sample Output

  
  
   
   8
  
  
  
  

  
  
  
  

  
  
  
  
   
   真的是一道很好的题.可以用网络流，最短路，树形DP等方法解决.DP不会.所以用那两个。
  
  
  
  

  
  
  
  
   
   最简单的就是最短路思想. 建立一个源点，指向所有的城市，边权为书费. 之后求最长路，对于源点到所有点的最长路减去每个城市的卖假，求最大值即可。
  
  
  
  
   
   我不知道为什么，我建立一个汇点，就会超时.可能是建立汇点会多遍历太多的边吧