题目链接:https://cn.vjudge.net/problem/UVA-1025
题意:从1号站到n号站要等待的最短时间(不在车上的时间);
最优子结构:某时刻I在某站台j到n号站的最短时间;dp[时间][站号];
边界条件:dp数组初始为无穷大(min); dp[t][n] = 0; t时刻在n站台不用等待;
奇技淫巧:定义数组hastran[时间][位置][方向]判断能否进行状态转移;
转移方程:
dp[i][j] = dp[i + 1][j] + 1;
//在本站相比上一秒又等了一秒
if (j < N && hastran[i][j][0] && i + t[j] <= T){
//i不是n站台 && i时刻j位置向右有车 &&j+到下一站时间小于t
dp[i][j] = min(dp[i][j], dp[i + t[j]][j + 1]);
}
if (j > 1 && hastran[i][j][1] && i + t[j-1] <= T){
dp[i][j] = min(dp[i][j], dp[i + t[j-1]][j-1]);
}
这道题放在前面还是有点吓人,状态转移的方式对我来说脑洞很大
完整代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int N, T, M1, M2;
int t[55];
int d1[55];
int d2[55];
int dp[205][55];
int hastran[205][55][2];
int main(){
int kase = 0;
while (~scanf("%d", &N) && N){
memset(dp, 1, sizeof(dp));
memset(hastran, 0, sizeof(hastran));
scanf("%d", &T);
for (int i = 1; i < N; i++) scanf("%d", &t[i]);
scanf("%d", &M1);
for (int i = 1; i <= M1; i++) scanf("%d", &d1[i]);
scanf("%d", &M2);
for (int i = 1; i <= M2; i++) scanf("%d", &d2[i]);
for (int i = 1; i <= M1; i++){
hastran[d1[i]][1][0] = 1;
for (int j = 1; j < N; j++){
d1[i] += t[j];
hastran[d1[i]][j + 1][0] = 1;
}
}
for (int i = 1; i <= M2; i++){
hastran[d2[i]][N][1] = 1;
for (int j = N - 1; j >= 1; j--){
d2[i] += t[j];
hastran[d2[i]][j][1] = 1;
}
}
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;
if (j < N && hastran[i][j][0] && i + t[j] <= T){
dp[i][j] = min(dp[i][j], dp[i + t[j]][j + 1]);
}
if (j > 1 && hastran[i][j][1] && i + t[j-1] <= T){
dp[i][j] = min(dp[i][j], dp[i + t[j-1]][j - 1]);
}
}
}
printf("Case Number %d: ", ++kase);
if (dp[0][1] > 10000000) printf("impossible\n");
else printf("%d\n", dp[0][1]);
}
}