HDU 4968 Improving the GPA

枚举。

　　枚举每个分段有多少个科目，对每个枚举的状态判断是否满足条件，对满足条件的取其中最大和最小值。

 

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;

const double eps=1e-8;

int main (){
    int t;
    int a,n;
    //cin>>t;
    scanf ("%d",&t);
    while (t--){
        //cin>>a>>n;
        scanf ("%d%d",&a,&n);
        int sum=a*n;
        double maxn,minn;
        int mas=n*4,mis=n*8;
        for (int i=0;i<=n;i++){
            for (int j=0;j<=n;j++){
                for (int k=0;k<=n;k++){
                    for (int o=0;o<=n;o++){
                        if (n>=i+j+k+o&&i*100+j*84+k*79+o*74+(n-i-j-k-o)*69>=sum&&i*85+j*80+k*75+o*70+(n-i-j-k-o)*60<=sum){
                            int temp=i*8+j*7+k*6+o*5+(n-i-j-k-o)*4;
                            mas=temp>mas?temp:mas;
                            mis=temp<mis?temp:mis;//cout<<i<<" "<<j<<" "<<k<<" "<<o<<" "<<n-i-j-k-o<<":"<<temp*1.0/n/2<<endl;
                        }
                    }
                }
            }
        }
        minn=1.0*mis/n/2+eps;
        maxn=1.0*mas/n/2+eps;
        printf ("%.4f %.4f\n",minn,maxn);
    }
    return 0;
}