# GTW likes math

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0

Problem Description
After attending the class given by Jin Longyu, who is a specially-graded teacher of Mathematics, GTW started to solve problems in a book titled “From Independent Recruitment to Olympiad”. Nevertheless, there are too many problems in the book yet GTW had a sheer number of things to do, such as dawdling away his time with his young girl. Thus, he asked you to solve these problems.

In each problem, you will be given a function whose form is like f(x)=ax2+bx+c. Your assignment is to find the maximum value and the minimum value in the integer domain [l,r].

Input
The first line of the input file is an integer T, indicating the number of test cases. (T1000)

In the following T lines, each line indicates a test case, containing 5 integers, a,b,c,l,r.     (|a|,|b|,|c|100,|l||r|100              ), whose meanings are given above.

Output
In each line of the output file, there should be exactly two integers, max and min, indicating the maximum value and the minimum value of the given function in the integer domain [l,r],   respectively, of the test case respectively.

Sample Input
1 1 1 1 1 3

Sample Output
13 3
Hint
f1=3,f2=7,f3=13,max=13,min=3

Source

/************************************************************************/

# GTW likes math

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 131072/131072 K (Java/Others)

某一天，GTW听了数学特级教师金龙鱼的课之后，开始做数学《从自主招生到竞赛》。然而书里的题目太多了，GTW还有很多事情要忙（比如把妹），于是他把那些题目交给了你。每一道题目会给你一个函数f(x)=ax^2+bx+c，求这个函数在整数区间[l,r]之间的最值。

第一行一个整数T，表示数据组数。(T\leq 1000)

对于每一组数据，共一行两个整数max，min，表示函数在整数区间[l,r]中的最大值和最小值。


1
1 1 1 1 2


7 3
Hint
f_1=3,f_2=7,最大值=7,最小值=3
/****************************************************/

## GTW likes math

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<string>
#include<algorithm>
#include<iostream>
#define exp 1e-10
using namespace std;
const int N = 25;
const int M = 710;
const int inf = 1000000000;
const int mod = 1000000007;
int main()
{
int a,b,c,l,r,t,i,Max,Min,y;
scanf("%d",&t);
while(t--)
{
Max=-inf;
Min=inf;
scanf("%d%d%d%d%d",&a,&b,&c,&l,&r);
for(i=l;i<=r;i++)
{
y=a*i*i+b*i+c;
Max=max(Max,y);
Min=min(Min,y);
}
printf("%d %d\n",Max,Min);
}
return 0;
}

• 写评论