题意见紫书P306。
这道题跟例题的修长城比较像, 也是用三维dp记录一个区间i, j , Alibaba在左端点或者右端点的时候的最短时间, 那么转移方程就是:
dp[i][j][0] = min(dp[i + 1][j][0] + a[i + 1] - a[i], dp[i + 1][j][1] + a[j] - a[i]);
dp[i][j][1] = min(dp[i][j - 1][0] + a[j] - a[i], dp[i][j - 1] + a[j] - a[j - 1]);
当然转移完之后要判断当前区间的时间是否已经大于等于这个点的最大时间, 已经大于等于就要把这个值改成inf代表这个不合法(注意:1,这里不能看到不合法就直接break,显然这个状态不合法不代表所有的都不合法; 2, 要>=, 只判>会wa- -我wa了无数发Orz);
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <string>
#include <cctype>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <algorithm>
using namespace std;
#define ls id<<1,l,mid
#define rs id<<1|1,mid+1,r
#define OFF(x) memset(x,-1,sizeof x)
#define CLR(x) memset(x,0,sizeof x)
#define MEM(x) memset(x,0x3f,sizeof x)
typedef long long ll ;
typedef pair<int,int> pii ;
const int maxn = 1e4+50 ;
const int inf = 0x3f3f3f3f ;
const int MOD = 1e9+7 ;
int n,t[maxn],loc[maxn];
int dp[maxn][maxn][2];
int main () {
#ifdef LOCAL
freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin);
// freopen("C:\\Users\\Administrator\\Desktop\\out.txt","w",stdout);
#endif
while (~scanf("%d", &n)) {
for (int i = 1; i <= n; i++) scanf("%d%d", loc + i, t + i);
for (int i = 1; i <= n; i++) dp[i][i][0] = dp[i][i][1] = 0;
for (int i = n; i; i--) {
for (int j = i + 1; j <= n; j++) {
dp[i][j][0] = min(dp[i + 1][j][0] + loc[i + 1] - loc[i], dp[i + 1][j][1] + loc[j] - loc[i]);
dp[i][j][1] = min(dp[i][j - 1][1] + loc[j] - loc[j - 1], dp[i][j - 1][0] + loc[j] - loc[i]);
if (dp[i][j][0] >= t[i]) dp[i][j][0] = inf;
if (dp[i][j][1] >= t[j]) dp[i][j][1] = inf;
}
}
int ans = min(dp[1][n][1], dp[1][n][0]);
if (ans < inf) printf("%d\n",ans);
else printf("No solution\n");
}
return 0;
}