题意不说了 书中说的很详细:
思路:
影响到决策的只有当前时间和所处的车站!
用dp[i][j]表示时刻i,你在车站j,最少还需要等待的时间
有三种决策:
1.等一分钟!
2.如果有向右的车,则搭乘向右的车!
3.如果有向左的车,则搭乘向左的车!
在输入m1和m2时就处理has_train 数组,has_train[i][j][0]表示有向左的车,1 表示有向右的车!
则倒着枚举时间T即可!
dp[T][n] = 0,其余都初始化为INF。
最后直接判断dp[0][1] // 在0 时刻,1站牌至少要等待的时间!
如果是无穷大(INF)直接impossbile
否则输出dp[0][1]
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 200 + 10;
int t[maxn];
const int INF = 1e9+10;
bool has_train[maxn][maxn][2]; // 0 is to left , 1 is to right;
int dp[maxn][maxn];// dp[i][j] 代表 在i 时刻, j 站牌的方案数量!
int main(){
int n,T,cnt=0;
int m1,m2;
while(scanf("%d",&n) == 1 && n){
memset(has_train,0,sizeof has_train);
scanf("%d",&T);
for (int i = 1; i <= n-1; ++i)scanf("%d",&t[i]);
scanf("%d",&m1);
for (int i = 1; i <= m1; ++i){
int k;
scanf("%d",&k);
int all = k;
for (int j = 1; j <= n; ++j){
if (all <= T)has_train[all][j][1] = true;// 防止越界!
all += t[j];
}
}
scanf("%d",&m2);
for (int i = 1; i <= m2; ++i){
int k;
scanf("%d",&k);
int all = k;
for (int j = n; j > 1; --j){
if (all <= T)has_train[all][j][0] = true;//防止越界!
all += t[j-1];
}
}
for (int k = 0; k <= T; ++k)
for (int i = 0; i <= n; ++i)
dp[k][i] = INF;
dp[T][n] = 0;
for (int i = T-1; i >= 0; --i){
for (int j = 1; j <= n; ++j){
dp[i][j] = dp[i+1][j] + 1; // wait for one minute!!
if (j < n && i + t[j] <= T && has_train[i][j][1])dp[i][j] = min(dp[i][j],dp[i+t[j]][j+1]);
if (j > 1 && i + t[j-1] <= T && has_train[i][j][0])dp[i][j] = min(dp[i][j],dp[i+t[j-1]][j-1]);
}
}
printf("Case Number %d: ",++cnt);
if (dp[0][1] >= INF)printf("impossible\n");
else printf("%d\n",dp[0][1]);
}
return 0;
}