遮擋判斷
Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 556 Accepted Submission(s): 160
假設每個石柱子是一根細棒,而且都垂直於地面擺放。
#include<iostream>
#include<stdlib.h>
using namespace std;
struct light
{
int x;
int h;
};
struct light l[100001];
int cmp(const void *a,const void *b)
{
return *(int *)a-*(int *)b;
}
int main()
{
int n,i,t,a,flag;
double k,max;
while(cin>>n)
{
max=0;
flag=0;
if(n==0)
return 0;
for(i=0;i<n;i++)
scanf("%d%d",&l[i].x,&l[i].h);
qsort(l,n,sizeof(l[0]),cmp);
scanf("%d/%d",&t,&a);
for(i=0;i<n;i++)
{
k=l[i].x+(l[i].h*1.0/t)*a; //陰影的長度
if(k>max)
{
max=k;
flag++;
}
}
cout<<flag<<endl;
}
system("pause");
return 0;
}