Master Di plans to take his girlfriend for a travel by bike. Their journey, which can be seen as a line segment of length L, is a road of swamps and flats. In the swamp, it takes A point strengths per meter for Master Di to ride; In the flats, Master Di will regain B point strengths per meter when riding. Master Di wonders:In the beginning, he needs to prepare how much minimum strengths. (Except riding all the time,Master Di has no other choice)
Input
In the first line there is an integer t (1≤t≤501≤t≤50), indicating the number of test cases.
For each test case:
The first line contains four integers, n, A, B, L.
Next n lines, each line contains two integers: Li,RiLi,Ri, which represents the interval [Li,Ri][Li,Ri] is swamp.
1≤n≤100,1≤L≤105,1≤A≤10,1≤B≤10,1≤Li<Ri≤L1≤n≤100,1≤L≤105,1≤A≤10,1≤B≤10,1≤Li<Ri≤L.
Make sure intervals are not overlapped which means Ri<Li+1Ri<Li+1 for each i (1≤i<n1≤i<n).
Others are all flats except the swamps.
Output
For each text case:
Please output “Case #k: answer”(without quotes) one line, where k means the case number counting from 1, and the answer is his minimum strengths in the beginning.
Sample Input
1 2 2 2 5 1 2 3 4
Sample Output
Case #1: 0
/*
这个人每一次经过沼泽都会消耗A能量
经过平地会增加B能量。用数组来保存
每一段路的能量 但是这样计算会时间
超限
*/
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int t;
scanf ("%d", &t);
int kase = 1;
while (t --)
{
int n, A, B, l;
scanf ("%d %d %d %d", &n, &A, &B, &l);
int sum = 0, p = 0, minx = 1e6;
for (int i = 0; i < n; i++)
{
int l1, r1;
scanf ("%d %d", &l1, &r1);
sum += B * (l1 - p) - A * (r1 - l1);
minx = min (sum, minx);
p = r1;
}
printf ("Case #%d: ", kase++);
printf("%d\n", minx > 0 ? 0 : -minx);
}
return 0;
}