HDOJ题目地址：传送门

A Sweet Journey

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 759 Accepted Submission(s): 397

Problem Description

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

题意：一个人去旅行，路上有沼泽和平路，当走平路是增加a点体力，当走沼泽时消耗b点体力，求最开始最少要携带多少点体力

#include<iostream>
#include<stdio.h>
#include<memory.h>
#include<algorithm>
using namespace std;
struct Node{int begin;int end;int chazhi;
}zhaoze[101];
bool cmp(Node a,Node b){if(a.begin<b.begin)return true;return false;
}
int main(){int n,m,i,a,b,l,kaishi,jieshu,result,temp,index=1;cin>>n;while(n--){cin>>m>>a>>b>>l;for(i=0;i<m;i++){cin>>zhaoze[i].begin>>zhaoze[i].end;zhaoze[i].chazhi=zhaoze[i].end-zhaoze[i].begin;}sort(zhaoze,zhaoze+m,cmp);result=0;temp=0;kaishi=0;jieshu=0;for(i=0;i<m;i++){temp=temp+(zhaoze[i].begin-jieshu)*b-zhaoze[i].chazhi*a;jieshu=zhaoze[i].end;if(result>temp){result=temp;}}temp+=(l-jieshu)*b;if(result>temp){result=temp;}if(result<0){printf("Case #%d: %d\n",index,-result);}else{printf("Case #%d: 0\n",index);}index++;}
}

ACM--过沼泽--模拟--HDOJ 5477--A Sweet Journey相关推荐

[2012山东ACM省赛] The Best Seat in ACM Contest （模拟）
The Best Seat in ACM Contest Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述 Cainiao is a ...
【HDU - 5477】A Sweet Journey（思维，水题）
题干: Master Di plans to take his girlfriend for a travel by bike. Their journey, which can be seen as ...
著名的北邮ACM推荐50题
著名的北邮ACM推荐50题 POJ推荐50题 1.标记"难"和"稍难"的题目可以看看,思考一下,不做要求,当然有能力的同学可以直接切掉. 2.标记为A and ...
50题（ACM学习推荐题）
POJ推荐50题 1. 标记"难"和"稍难"的题目可以看看,思考一下,不做要求,当然有能力的同学可以直接切掉. 2. 标记为 A and B 的题目是比较相似的 ...
Linux 常见问题 1000 个详细解答
一. 如何建立多用户提醒大家一句,别一直使用root用户,因为root用户在系统中有着至高无上的权力,一不小心就可能破坏系统.比如我们想删除/temp目录下的文件却将命令不小心输成"rm ...
Linux 170个常见问题的详细解答
Linux 170个常见问题的详细解答 <?xml:namespace prefix = o ns = "urn:schemas-microsoft-com:office:offi ...
国际计算机编程大赛报名,关于举办2020年新生编程大赛的报名通知
各班级: 为了培养和发展大学生分析.解决问题和计算机编程的能力,鼓励和培养创新思维,丰富校园学术气氛,造就具有综合素质的面向21世纪的计算机科学人才,决定举办2020年新生编程大赛.现将有关事项通知如 ...
语法入门*算法入门题单
作者:王清楚链接:https://ac.nowcoder.com/discuss/817596?type=101&order=0&pos=1&page=4&chann ...
java中如何输入字符
char m = input.next().charAt(0); 下面是ACM中的模拟计算器的题目,以此作为示例: import java.util.*; public class Main { pu ...

ACM--过沼泽--模拟--HDOJ 5477--A Sweet Journey

A Sweet Journey

ACM--过沼泽--模拟--HDOJ 5477--A Sweet Journey相关推荐

最新文章

热门文章