HDU 5477 A Sweet Journey

题目地址：点击打开链接

题意：一个人骑车过一条L长的路，过一米沼泽需要耗费A点精力，过一米平原回升B点精力，总共有n个沼泽，问刚开始最少需要的精力

思路：水题，从后往前扫一遍就行了

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>

using namespace std;

struct edge
{
    int start,end1;
}road[110];

int cmp(const void* _a,const void* _b)
{
    struct edge *a = (edge*)_a;
    struct edge *b = (edge*)_b;
    return a->end1 - b->end1;
}
int main()
{
    int t,n,a,b,l;
    int i,cas = 1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d%d",&n,&a,&b,&l);
        for(i=0; i<n; i++)
        {
            scanf("%d%d",&road[i].start,&road[i].end1);
        }
        qsort(road,n,sizeof(road[0]),cmp);
        int sum = 0;
        sum += (road[n-1].end1 - road[n-1].start) * a;
        for(i=n-2; i>=0; i--)
        {
            sum -= (road[i+1].start - road[i].end1) * b;
            if(sum < 0)
                sum = 0;
            sum += (road[i].end1 - road[i].start) * a;
        }
        sum -= (road[0].start - 0) * b;
        if(sum < 0)
            sum = 0;
        printf("Case #%d: %d\n",cas++,sum);
    }
    return 0;
}