链接:https://vjudge.net/problem/248423/origin
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≤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,Ri, which represents the interval [Li,Ri] is swamp.
1≤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+1 for each i (1≤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
菜鸡只会做水题,难受啊!
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
struct node
{
int x,y;
}node[110];
int main()
{
int n;
cin>>n;
int case1=1;
while(n--)
{
memset(node,0,sizeof(node));
int m,a,b;
long long int l;
cin>>m>>a>>b>>l;
int nn=0;
for(int i=1;i<=m;i++) {cin>>node[i].x>>node[i].y;nn=nn+node[i].y-node[i].x;}
nn=nn*a;
int i=1;
int sum=0;
int ak=0;int j=0;
while(j<=node[m].y)
{
if(j==node[i].x) {
sum=sum-a*(node[i].y-node[i].x);
j=node[i].y;
i++;
}
else {sum+=b;j++;}
//if(j==3) cout<<"ads"<<endl;
ak=min(sum,ak); //cout<<j<<" "<<ak<<" "<<sum<<endl;
}
printf("Case #%d: %d\n",case1++,-1*ak);
}
return 0;
}```