城市里的间谍（A Spy in the Metro UVa 1025）最详细题解

累加器传送门：

http://blog.youkuaiyun.com/NOIAu/article/details/71775000

题目传送门：

https://vjudge.net/problem/UVA-1025

题目内容：

Secret agent Maria was sent to Algorithms City to carry out an especially dangerous mission. After
several thrilling events we nd her in the rst station of Algorithms City Metro, examining the time
table. The Algorithms City Metro consists of a single line with trains running both ways, so its time
table is not complicated.
Maria has an appointment with a local spy at the last station of Algorithms City Metro. Maria
knows that a powerful organization is after her. She also knows that while waiting at a station, she is
at great risk of being caught. To hide in a running train is much safer, so she decides to stay in running
trains as much as possible, even if this means traveling backward and forward. Maria needs to know
a schedule with minimal waiting time at the stations that gets her to the last station in time for her
appointment. You must write a program that nds the total waiting time in a best schedule for Maria.
The Algorithms City Metro system has N stations, consecutively numbered from 1 to N. Trains
move in both directions: from the rst station to the last station and from the last station back to the
rst station. The time required for a train to travel between two consecutive stations is xed since all
trains move at the same speed. Trains make a very short stop at each station, which you can ignore
for simplicity. Since she is a very fast agent, Maria can always change trains at a station even if the
trains involved stop in that station at the same time.

输入：

The input le contains several test cases. Each test case consists of seven lines with information as
follows.
Line 1. The integer N (2 N 50), which is the number of stations.
Line 2. The integer T (0 T 200), which is the time of the appointment.
Line 3. N 1 integers: t1; t2; : : : ; tN1 (1 ti 20), representing the travel times for the trains
between two consecutive stations: t1 represents the travel time between the rst two stations, t2
the time between the second and the third station, and so on.
Line 4. The integer M1 (1 M1 50), representing the number of trains departing from the rst
station.
Line 5. M1 integers: d1; d2; : : : ; dM1 (0 di 250 and di < di+1), representing the times at which
trains depart from the rst station.
Line 6. The integer M2 (1 M2 50), representing the number of trains departing from the N-th
station.
Line 7. M2 integers: e1; e2; : : : ; eM2 (0 ei 250 and ei < ei+1) representing the times at which
trains depart from the N-th station.
The last case is followed by a line containing a single zero.

输出：

For each test case, print a line containing the case number (starting with 1) and an integer representing
the total waiting time in the stations for a best schedule, o