【CUGBACM15级BC第18场 B】hdu 5105 Math Problem
来源:互联网 发布:手机淘宝购买成功截图 编辑:程序博客网 时间:2024/05/17 01:36
Math Problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3142 Accepted Submission(s): 762
Total Submission(s): 3142 Accepted Submission(s): 762
Problem Description
Here has an function:
f (x )=|a∗x3+b∗x2+c∗x+d | (L≤x≤R )
Please figure out the maximum result of f(x).
Please figure out the maximum result of f(x).
Input
Multiple test cases(less than 100). For each test case, there will be only 1 line contains 6 numbers a, b, c, d, L and R.(−10≤a,b,c,d≤10,−100≤L≤R≤100)
Output
For each test case, print the answer that was rounded to 2 digits after decimal point in 1 line.
Sample Input
1.00 2.00 3.00 4.00 5.00 6.00
Sample Output
310.00
别的没啥可说的,就是有唯一的大坑。。。前方高能= =:
http://blog.csdn.net/greatjames/article/details/77131177
#include <bits/stdc++.h>#define _ ios_base::sync_with_stdio(0);cin.tie(0);using namespace std;double a, b, c, d, L, R;double f(double x){ return abs(a * x * x * x + b * x * x + c * x + d);}bool judge(double x){ if (x >= L && x <= R) { return true; } else { return false; }}int main(){ _ while (cin >> a >> b >> c >> d >> L >> R) { ///cout << 6.0 / 1.5 * 100 << endl; ///cout << 6.0 / (1.5 * 100) << endl; double ans = max(f(L), f(R)); if (a != 0) { double ter = 4 * b * b - 12 * a * c; if (ter <= 0) { printf("%0.2f\n", ans); continue; } double x1 = (-2 * b + (double)sqrt(ter)) / (6 * a); double x2 = (-2 * b - (double)sqrt(ter)) / (6 * a); double v; if (judge(x1) == true && judge(x2) == true) { v = max(f(x1), f(x2)); ans = max(ans, v); } else if (judge(x1) == true && judge(x2) == false) { v = f(x1); ans = max(ans, v); } else if (judge(x1) == false && judge(x2) == true) { v = f(x2); ans = max(ans, v); } } else if (a == 0 && b != 0) { double hh = -c / (2 * b); if (judge(hh) == true) { ans = max(ans, f(hh)); } } printf("%0.2f\n", ans); } return 0;}
阅读全文
0 0
- 【CUGBACM15级BC第18场 B】hdu 5105 Math Problem
- 【CUGBACM15级BC第11场 B】hdu 5055 Bob and math problem
- 【CUGBACM15级BC第29场 A】hdu 5170 GTY's math problem
- 【CUGBACM15级BC第15场 B】hdu 5082 Instruction
- 【CUGBACM15级BC第17场 B】hdu 5101 Select
- 【CUGBACM15级BC第20场 B】hdu 5124 lines
- 【CUGBACM15级BC第26场 B】hdu 5159 Card
- 【CUGBACM15级BC第28场 B】hdu 5167 Fibonacci
- 【CUGBACM15级BC第36场 B】hdu 5199 Gunner
- 【CUGBACM15级BC第18场 A】hdu 5104 Primes Problem
- 【CUGBACM15级BC第24场 C】hdu 5152 A Strange Problem
- 【CUGBACM15级BC第12场 B】hdu 5059 Help him
- 【CUGBACM15级BC第13场 B】hdu 5063 Operation the Sequence
- 【CUGBACM15级BC第22场 B】hdu 5143 NPY and arithmetic progression
- 【CUGBACM15级BC第23场 B】hdu 5147 Sequence II
- 【CUGBACM15级BC第25场 B】hdu 5155 Harry And Magic Box
- 【CUGBACM15级BC第27场 B】hdu 5163 Taking Bus
- 【CUGBACM15级BC第10场 B】hdu 5019 Revenge of GCD
- Printf输出顺序
- FPGA Fanout-Fanin(扇入扇出)
- mariadb
- JVM虚拟机原理
- 循环
- 【CUGBACM15级BC第18场 B】hdu 5105 Math Problem
- 入职一个月——告别学生时代
- 网络通讯-协议、IO浅述
- 牛客7
- CSS BFC
- ubuntu14.04下安装eclipse(包括安装jdk)
- 网络协议篇之CWMP协议(三)—— RPC方法
- 计算含有汉字的字符串的长度
- npm、模块暴露,小知识点区别