A Sweet Journey

最新推荐文章于 2021-07-30 20:29:58 发布

yuebaba

最新推荐文章于 2021-07-30 20:29:58 发布

阅读量137

点赞数

分类专栏：二分+尺取

本文链接：https://blog.csdn.net/yuebaba/article/details/81320339

版权

二分+尺取专栏收录该内容

4 篇文章 0 订阅

订阅专栏

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

Sample Output

Case #1: 0

#include<iostream>
#include<algorithm>
#include<cstring>
int min(int a,int b)
{
	if(a>b)
	return b;
	else
	return a; 
}
using namespace std;
int main()
{
	int n,a,b,l,t;
	int x,y;
	int k=1;
	scanf("%d",&t);
	while(t--)
	{
		int sum=0,m=int(1e8),end=0;
		scanf("%d%d%d%d",&n,&a,&b,&l);
		while(n--)
		{
			scanf("%d%d",&x,&y);
			sum=sum+(x-end)*b-(y-x)*a;
			m=min(sum,m);
			end=y; 
		}
		printf("Case #%d: ",k++);
		if(m<0)
		  printf("%d\n",-m);
		else
		  printf("0\n");
	}
	return 0;
}