A Sweet Journey

A Sweet Journey

.
.
题意：一个人骑车，对于泥泞的路每单位耗费A点体力，对于平滑的路每单位恢复B点体力，问一开始最少储备多少体力能通过。
.
.
解法：直接从0开始求，记录体力的最小值。如果小于0那么就储备那么多就好了，否则就是0。
.
.

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;

int A, B, n, l, t, x, y, minn, s;


int main() {

    int tt;
    scanf("%d", &tt);
    for (int cases = 1; cases <= tt; cases++) {
        scanf("%d %d %d %d", &n, &A, &B, &l);
        s = 0;
        t = 0;
        minn = 0;
        for (int i = 1; i <= n; i++) {
            scanf("%d %d", &x, &y);
            if (x > t) {
                s = s+(x-t)*B;
            }
            s = s-(y-x)*A;
            if (s < minn) minn = s;
            t = y;
        }
        printf("Case #%d: %d\n", cases, -minn);
    }
}