URAL1031——DP——Railway Tickets

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[10010];
int L[4],C[4],s[10010];
const int inf = 0x3f3f3f3f;
int main()
{
    int s1,s2;
    int n;
    while(~scanf("%d%d%d%d%d%d",&L[1],&L[2],&L[3],&C[1],&C[2],&C[3])){
        scanf("%d",&n);
        scanf("%d%d",&s1,&s2);
        if(s1 > s2) {
            int temp = s1;
            s1 = s2;
            s2 = temp;
        }
        s[1] = 0;
        for(int i = 2; i <= n ;i++)
            scanf("%d",&s[i]);
        for(int i = 1; i <= n;i++)
            dp[i] = inf;
        dp[s1] = 0;
        for(int k = s1 + 1; k <= s2; k++){
            for(int p = 1; p <= 3; p++){
                int j = k - 1;
                while(j >= s1){
                    if(s[k] - s[j] > L[p])
                        break;
                    dp[k] = min(dp[k],dp[j]+C[p]);
                    j--;
                }
            }
        }
        printf("%d\n",dp[s2]);
    }
    return 0;
}