poj 2355

poj 2355
有n个火车站 告诉你每个火车站的位置， 从s站搭火车到t站， 求最小价格
dp[i]表示第i个车站所需的最小价格
dp[i] = min(dp[i],dp[j] + c) (a[i] - a[j] <= l)

#include <iostream>
#include <cstdio>
#include <cstring>
#define ll long long 
using namespace std;
const int maxn = 10010;
ll dp[maxn],l[maxn],a,b,n,l1,l2,l3,c1,c2,c3;
int main()
{
    scanf("%lld%lld%lld%lld%lld%lld",&l1,&l2,&l3,&c1,&c2,&c3);
    scanf("%lld%lld%lld",&n,&a,&b);
    if(a > b) swap(a,b);dp[a] = 0;
    for(int i = 2; i <= n; ++i) scanf("%lld",&l[i]);
    for(int i = a + 1; i <= b; ++i)
    {
        dp[i] = 0x7fffffff; 
        int ll3 = l[i] - l3,ll2 = l[i] - l2,ll1 = l[i] - l1,le = a,r = b;
        while(le <= r)
        {
            int mid = (le + r) >> 1;
            if(ll1 <= l[mid]) r = mid - 1;
            else le = mid + 1;
        }
        dp[i] = min(dp[le] + c1,dp[i]);
        le = a;r = b;
        while(le <= r)
        {
            int mid = (le + r) >> 1;
            if(ll2 <= l[mid]) r = mid - 1;
            else le = mid + 1;
        }
        dp[i] = min(dp[le] + c2,dp[i]);
        le = a;r = b;
        while(le <= r)
        {
            int mid = (le + r) >> 1;
            if(ll3 <= l[mid]) r = mid - 1;
            else le = mid + 1;
        }
        dp[i] = min(dp[le] + c3,dp[i]);
    }
    printf("%lld",dp[b]);

    return 0;
}