解题思路:
注意事项:
参考代码:
#include<stdio.h>
#include<math.h>
struct t
{
int x1,y1,x2,y2;
int m;
};
int main(void)
{
int i,n,x,y,p,max;
struct t a[10000];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d%d",&a[i].x1,&a[i].y1,&a[i].x2,&a[i].y2);
a[i].m=abs((a[i].x2-a[i].x1)*(a[i].y2-a[i].y1));
}
scanf("%d%d",&x,&y);
max=0;
for(i=1;i<=n;i++)
{
if(((x>=a[i].x1&&x<=a[i].x2)||(x>=a[i].x2&&x<=a[i].x1))&&((y>=a[i].y1&&y<=a[i].y2)||(y>=a[i].y2&&y<=a[i].y1))&&(max<a[i].m))
{
max=a[i].m;
p=i;
}
}
printf("%d\n",p);
return 0;
}
0.0分
0 人评分