2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 B.Train Seats Reservation（模拟）

缺乏、安全感 2022-06-08 11:37 199阅读 0赞

You are given a list of train stations, say from the station 11 to the station 100100.

The passengers can order several tickets from one station to another before the train leaves the station one. We will issue one train from the station 11 to the station 100100 after all reservations have been made. Write a program to determine the minimum number of seats required for all passengers so that all reservations are satisfied without any conflict.

Note that one single seat can be used by several passengers as long as there are no conflicts between them. For example, a passenger from station 11 to station 1010 can share a seat with another passenger from station 3030to 6060.

### Input Format ###

Several sets of ticket reservations. The inputs are a list of integers. Within each set, the first integer (in a single line) represents the number of orders, n*n*, which can be as large as 10001000. After n*n*, there will be n*n* lines representing the n*n* reservations; each line contains three integers s, t, k*s*,*t*,*k*, which means that the reservation needs k*k* seats from the station s*s* to the station t*t* .These ticket reservations occur repetitively in the input as the pattern described above. An integer n = 0*n*=0 (zero) signifies the end of input.

### Output Format ###

For each set of ticket reservations appeared in the input, calculate the minimum number of seats required so that all reservations are satisfied without conflicts. Output a single star '\*' to signify the end of outputs.

#### 样例输入 ####

2
    1 10 8
    20 50 20
    3
    2 30 5
    20 80 20
    40 90 40
    0

#### 样例输出 ####

20
    60
    *

题解：

直接用一个长度为100的数组，每次在s，t段加上数字k，最后扫一遍数组求最大值就行了。。

签到题，一开始我模拟的是错的，因为如果s==t的时候输出0我模拟错了，后来老赵a了，就不给代码了