hdu 5595

GTW likes math

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

Total Submission(s): 125    Accepted Submission(s): 76

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. ( T≤1000 )

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
    
    
$f_1=3,f_2=7,f_3=13,max=13,min=3$
   
   
   
    
  
  

 

Source

BestCoder Round #66 (div.2)

//第一题还有一个罚时 真是low啊

#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int a,b,c;
int f(int i)
{
    return a*i*i+b*i+c;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int l,r;
        scanf("%d%d%d%d%d",&a,&b,&c,&l,&r);
        int ma,mi;
        ma=-10000000;
        mi=100000000;
        for(int i=l;i<=r;i++)
        {
            int t=f(i);
            if(t>ma)
                ma=t;
            if(t<mi)
                mi=t;
        }
        printf("%d %d\n",ma,mi);
    }
    return 0;
}