hdu 4445 37届金华赛区 D题

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
using namespace std;
#define MOD 1000000007
const double PI=acos(-1.0);
const double eps=1e-5;
const double g=9.8;
#define cl(a) memset(a,0,sizeof(a))
#define ts printf("*****\n");
const int MAXN=100006;
int cnt[MAXN],a;
int n,m,tt;
double H,L1,L2,R1,R2;
double v[MAXN];
int fun(double an)
{
int ans=0;
for(int i=0;i<n;i++)
{
double vy=v[i]*sin(an);
double vx=v[i]*cos(an);
double vyy=sqrt(2*g*H+vy*vy);
double t=(vyy-vy)/g;
double x=t*vx;
if(x>=L2&&x<=R2)return 0;
if(L1<=x&&x<=R1)
{
ans++;
}
}
return ans;
}
int main()
{
int j,k;
#ifndef ONLINE_JUDGE
freopen("1.in","r",stdin);
#endif
int ca=0;
double i;
while(scanf("%d",&n)!=EOF)
{
if(n==0)    break;
scanf("%lf%lf%lf%lf%lf",&H,&L1,&R1,&L2,&R2);
for(int j=0;j<n;j++)
scanf("%lf",&v[j]);
int sum=0;
for(i=-PI/2;i<=PI/2;i+=(PI/1000))
{
sum=max(sum,fun(i));
}
printf("%d\n",sum);
}
return 0;
}