第四十六题 UVA1025 城市里的间谍 A Spy in the Metro

• 紫书第九章 我太喜欢动态规划了，以前是，现在不是…
  哈哈哈哈哈哈哈哈，还是动态规划有意思 思维量O（玄学） 代码量一般情况下 小于一百行

Secret agent Maria was sent to Algorithms City to carry out an especially dangerous mission. After
several thrilling events we find her in the first 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 finds 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 first station to the last station and from the last station back to the
first station. The time required for a train to travel between two consecutive stations is fixed 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.
Input
The input file 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, . . . , tN−1 (1 ≤ ti ≤ 20), representing the travel times for the trains
between two consecutive stations: t1 represents the travel time between the first 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 first
station.
Line 5. M1 integers: d1, d2, . . . , dM1 (0 ≤ di ≤ 250 and di < di+1), representing the times at which
trains depart from the first 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.
Output
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, or the word ‘impossible’ in case Maria is
unable to make the appointment. Use the format of the sample output.
Sample Input
4
55
5 10 15
4
0 5 10 20
4
0 5 10 15
4
18
1 2 3
5
0 3 6 10 12
6
0 3 5 7 12 15
2
30
20
1
20
7
1 3 5 7 11 13 17
0
Sample Output
Case Number 1: 5
Case Number 2: 0
Case Number 3: impossible

题目大意

某城市的地铁是线性的，有n（2≤n≤50）个车站，从左到右编号为1～n。有M1辆列车从第1站开始往右开，还有M2辆列车从第n站开始往左开。在时刻0，Mario从第1站出发，目的是在时刻T（0≤T≤200）会见车站n的一个间谍。在车站等车时容易被抓，所以她决定尽量躲在开动的火车上，让在车站等待的总时间尽量短。列车靠站停车时间忽略不计，且Mario身手敏捷，即使两辆方向不同的列车在同一时间靠站，Mario也能完成换乘。
输入第1行为n，第2行为T，第3行有n－1个整数t1,t2,…,tn−1（1≤ti≤70），其中ti表示地铁从车站i到i＋1的行驶时间（两个方向一样）。第4行为M1（1≤M1≤50），即从第1站出发向右开的列车数目。第5行包含M1个整数d1, d2,…, dM1（0≤di≤250，di＜di+1），即各列车的出发时间。第6、7行描述从第n站出发向左开的列车，格式同第4、5行。输出仅包含一行，即最少等待时间。无解输出impossible。
分析

时间是单向流逝的，是一个天然的“序”。影响到决策的只有当前时间和所处的车站，所以可以用d(i,j)表示时刻i，你在车站j（编号为1～n），最少还需要等待多长时间。边界条件是d(T,n)=0，其他d(T,i)（i不等于n）为正无穷。有如下3种决策。

决策1：等1分钟。
决策2：搭乘往右开的车（如果有）。
决策3：搭乘往左开的车（如果有）。

数组has，has[t][i][0]表示时刻t，在车站i是否有往右开的火车，has[t][i][1]类似，不过记录的是往左开的火车。
数组f[t][i] 表示时刻t，并且当前在车站i最少还需要等待多长时间 显然f[T][n] = 0
方程倒着推

#include
#include
#include
#include
#define Maxn 52
#define Maxt 202

using namespace std;
const int INF = 0x3f3f3f3f;
int t[Maxn],f[Maxt][Maxn],has[Maxt][Maxn][2];


int main(int argc,char* argv[]) {
	int n,m,M1,M2,flag,kase = 0,T;
	while(scanf("%d",&n) != EOF && n) {
		memset(has,0,sizeof(has));
		memset(t,0,sizeof(t));
		memset(f,INF,sizeof(f));
		scanf("%d",&T);
		for(int i=1; i<n; i++) 
			scanf("%d",&t[i]);// 从车站i到车站i+1的 消耗时间
		scanf("%d",&M1);
		for(int i=1; i<=M1; i++) {
			scanf("%d",&flag);
			for(int j=1; j<=n; j++) {
				flag += t[j-1];
				has[flag][j][0] = 1;
			}
		} 
		scanf("%d",&M2);
		for(int i=1; i<=M2; i++) {
			scanf("%d",&flag);
			for(int j=n; j>=1; j--) {
				flag += t[j];
				has[flag][j][1] = 1;
			}
		}
		for(int i=1; i<=n-1; i++) f[T][i] = INF;
		f[T][n] = 0;
		for(int i=T-1; i>=0; i--) 
			for(int j=1; j<=n; j++) {
				f[i][j] = f[i + 1][j] + 1; // 在原始车站等了一分钟
				if(j < n && has[i][j][0] && i + t[j] <= T)
					f[i][j] = min(f[i][j],f[i + t[j]][j + 1]);// 向右走 
				if(j > 1 && has[i][j][1] && i + t[j - 1] <= T)
					f[i][j] = min(f[i][j],f[i + t[j - 1]][j - 1]); // 向左走 
			}
		printf("Case Number %d: ",++kase);
		if(f[0][1] >= INF) printf("impossible\n");
		else printf("%d\n",f[0][1]);
	}	
	return 0;
}