学步园

The railway line "Ekaterinburg-Sverdlovsk" with several stations has been built. This railway line can be represented as a line segment, railway stations being points on it. The railway line starts at the station "Ekaterinburg"
and finishes at the station "Sverdlovsk", so stations are numbered starting from "Ekaterinburg" (it has number 1) and "Sverdlovsk" is the last station.


Cost of the ticket between any two stations depends only on a distance between them. The prices for the tickets are specified in the following table.

distance between stations -X	price for the ticket
0<X<=L1	C1
L1<X<=L2	C2
L2<X<=L3	C3

Direct tickets from one station to another can be booked if and only if the distance between these station does not exceed L3. So sometimes it is necessary to book several tickets to pay for the parts of the whole way between stations.

For example, on the railway line shown at the figure above there are seven stations. The direct ticket from the second station to the sixth one can not be booked. There are several ways to pay for the travel between these stations. One of them is to book two
tickets: one ticket at price C2 to travel between the second and the third stations, and other at price C3 to travel between the third and the sixth stations. Note, that though the distance between the second and the sixth stations is equal to 2*L2, the whole
travel can not be paid by booking two tickets at price C2, because each ticket is valid for only one travel and each travel should start and end only at stations.

Your task is to write a program, that will find the minimal cost of the travel between two given stations.

The first line of the input file contains 6 integers L1, L2, L3, C1, C2, C3 (1 <= L1 < L2 < L3 <= 10^9, 1 <= C1 < C2 < C3 <= 10^9) in the specified order with one space between. The second line contains the amount of stations N
(2 <= N <= 10000). The third line contains two different integers separated by space. They represent serial numbers of stations, the travel between which must be paid. Next N-1 lines contain distances from the first station ("Ekaterinburg") on the railway
line to others. These distances are given as different positive integers and are arranged in the ascending order. The distance from "Ekaterinburg" to "Sverdlovsk" does not exceed 10^9. The distance between any neighboring stations does not exceed L3. The minimal
travel cost between two given stations will not exceed 10^9.

Program should print to the output file the only number, which is the minimal travel cost between two given stations.

3 6 8 20 30 40
7
2 6
3
7
8
13
15
23

70

Ural Collegiate Programming Contest 1999

水dp，一开始还想着用线段树去优化，结果暴力就过了

#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int inf = 0x3f3f3f3f;
const int N = 10010;
int dp[N];
int sta[N];

int main()
{
	int l1, l2, l3;
	int c1, c2, c3;
	int n, s, e;
	while(~scanf("%d%d%d%d%d%d", &l1, &l2, &l3, &c1, &c2, &c3))
	{
		// printf("%I64d\n", inf);
		scanf("%d", &n);
		scanf("%d%d", &s, &e);
		if (s > e)
		{
			swap(s, e);
		}
		memset (dp, inf, sizeof(dp));
		sta[1] = 0;
		dp[e] = 0;
		for (int i = 2; i <= n ; ++i)
		{
			scanf("%d", &sta[i]);
		}
		for (int i = e - 1; i >= s; --i)
		{
			for (int j = i; j <= e; ++j)
			{
				if (sta[j] - sta[i] > l3)
				{
					break;
				}
				if (sta[j] - sta[i] <= l1)
				{
					dp[i] = min(dp[i], dp[j] + c1);
				}
				else if (sta[j] - sta[i] <= l2)
				{
					dp[i] = min(dp[i], dp[j] + c2);
				}
				else
				{
					dp[i] = min(dp[i], dp[j] + c3);
				}
			}
		}
		printf("%d\n", dp[s]);
	}
	return 0;
}