HDU4445Crazy Tank

http://acm.hdu.edu.cn/showproblem.php?pid=4445

12jinhua

#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <queue>
#include <list>
#include <stack>
using namespace std;
#define NN 16384
#define INF 0x7ffffff
#define N 400
#define eps 1e-6
#define pi 3.14159265358979626

//const double pi=acos(-1);
const double g=9.8;

int n;
double v[N],h,l1,r1,l2,r2;

int main()
{
    //freopen("a.c","r",stdin);

    while (1)
    {
        scanf("%d",&n);
        if (n==0) break;

        scanf("%lf%lf%lf%lf%lf",&h,&l1,&r1,&l2,&r2);
        for (int i=1;i<=n;i++) scanf("%lf",&v[i]);

        double x;
        int i,sum,Max=0;
        for (double thi=-pi/4;thi<=pi/2;thi+=0.0015)
        {
            sum=0;

            for (i=1;i<=n;i++)
            {
                x=v[i]*cos(thi)*( sqrt(v[i]*v[i]*sin(thi)*sin(thi)+2*g*h)-v[i]*sin(thi) )/g;

                if ( (x>=l2 && x<=r2) || fabs(x-l2)<eps || fabs(x-r2)<eps )
                {
                    sum=-1;
                    break;
                }

                if ( (x>=l1 && x<=r1) || fabs(x-l1)<eps || fabs(x-r1)<eps ) sum++;
            }

            if (sum>Max) Max=sum;
        }

        printf("%d\n",Max);
    }

    return 0;
}