HDU 5595/BC 66A GTW likes math

注意题目要求是整数区间 即区间内只能取整数值 而l,r又很小 所以暴力for一遍就可以了

如果优化 可以去对称轴附近的两个整数点 而且要注意a为0的情况

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define INF (1ll<<62)
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
using namespace std;
typedef long long ll;
#define bug puts("===========");
const double pi=(acos(-1.0));
const double eps=1e-8;
const int inf=1e9+10;
const int maxn=300000+5;
const int mod=1e9+7;
/*===============================*/
ll a,b,c,l,r;
ll f(ll x){
    return a*x*x+b*x+c;
}
int main()
{
    int T_T;
    scanf("%d",&T_T);
    while(T_T--){
        scanf("%I64d%I64d%I64d%I64d%I64d",&a,&b,&c,&l,&r);
        ll maxx=-1e18,minn=1e18;
        for(int i=l;i<=r;i++){
        maxx=max(maxx,f(i));
        minn=min(minn,f(i));
        }
        printf("%I64d %I64d\n",maxx,minn);
    }
    return 0;
}