hdu4968

题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=4968

说是考dp，但是我没出来dp在哪，可能贪心思想更多一些吧。

AC代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define ll long long
const int maxn=1e5+;
const int INF=0x3f3f3f3f;

int score,n;

double mx(int x)
{
    double ans;
    if(score>=) return 4.0*n;
    ans=2.0*n;
    x-=*n;
    for(int i=;i<=n;i++)
    {
        if(x>) {x-=;ans+=0.5;} else break;  ///
        if(x>) {x-=;ans+=0.5;} else break;   ///
        if(x>) {x-=;ans+=0.5;} else break;    ///
        if(x>) {x-=;ans+=0.5;} else break;    ///
    }
    return ans;
}

double mn(int x)
{
    double ans;
    if(score<) return 2.0*n;
    ans=2.0*n;
    x-=*n;
    for(int i=;i<=n;i++)
    {
        if(x>) {x-=;ans+=0.5;} else break;  ///
        if(x>) {x-=;ans+=0.5;} else break;   ///
        if(x>) {x-=;ans+=0.5;} else break;    ///
        if(x>) {x-=;ans+=0.5;} else break;    ///
    }
    return ans;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&score,&n);
        int sum=score*n;
        double minn=mn(sum);
        double maxx=mx(sum);
        printf("%.4f %.4f\n",minn/n,maxx/n);
    }
    return ;
}