最新公告
  • 欢迎您光临波比源码,本站秉承服务宗旨 履行“站长”责任,销售只是起点 服务永无止境!立即加入我们
  • POJ2355――Railway tickets

    Railway tickets
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 2710   Accepted: 962

    Description

    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.

    Input

    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⑴ 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.

    Output

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

    Sample Input

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

    Sample Output

    70

    Source

    Ural Collegiate Programming Contest 1999

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

    #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
    ", 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
    ", dp[s]);
    }
    return 0;
    }

    波比源码 – 精品源码模版分享 | www.bobi11.com
    1. 本站所有资源来源于用户上传和网络,如有侵权请邮件联系站长!
    2. 分享目的仅供大家学习和交流,您必须在下载后24小时内删除!
    3. 不得使用于非法商业用途,不得违反国家法律。否则后果自负!
    4. 本站提供的源码、模板、插件等等其他资源,都不包含技术服务请大家谅解!
    5. 如有链接无法下载、失效或广告,请联系管理员处理!
    6. 本站资源售价只是赞助,收取费用仅维持本站的日常运营所需!
    7. 如遇到加密压缩包,请使用WINRAR解压,如遇到无法解压的请联系管理员!

    波比源码 » POJ2355――Railway tickets

    常见问题FAQ

    免费下载或者VIP会员专享资源能否直接商用?
    本站所有资源版权均属于原作者所有,这里所提供资源均只能用于参考学习用,请勿直接商用。若由于商用引起版权纠纷,一切责任均由使用者承担。更多说明请参考 VIP介绍。
    提示下载完但解压或打开不了?
    最常见的情况是下载不完整: 可对比下载完压缩包的与网盘上的容量,若小于网盘提示的容量则是这个原因。这是浏览器下载的bug,建议用百度网盘软件或迅雷下载。若排除这种情况,可在对应资源底部留言,或 联络我们.。
    找不到素材资源介绍文章里的示例图片?
    对于PPT,KEY,Mockups,APP,网页模版等类型的素材,文章内用于介绍的图片通常并不包含在对应可供下载素材包内。这些相关商业图片需另外购买,且本站不负责(也没有办法)找到出处。 同样地一些字体文件也是这种情况,但部分素材会在素材包内有一份字体下载链接清单。
    波比源码
    一个高级程序员模板开发平台
    升级波友尊享更多特权立即升级