Company: Agoda
Difficulty: medium
City Attractions You have just arrived in a new city and would like to see its sights. Each sight is located in a square and you have assigned each a beauty value. Each road is a square takes an amount of time to travel, and you have arranged time for sightseeing. Determine the maximum sum of beauty that you can visit during your time in the city. Start and finish at your hotel, the location of sight zero. Function Parameters int n : an integer, the number of sights in the city int m : an integer, the number of connecting roads int max_t : an integer, the amount of time for sightseeing vector<int> beauty : integer array, the beauty values assigned to each sight vector<int> u : integer array, the starting sight location for each bidirectional road vector<int> v : integer array, the ending sight location for each bidirectional road vector<int> t : integer array, the travel time for each bidirectional road Returns int : an integer, the maximum sum of beauty values