洛谷 P1003 铺地毯

#include<iostream>
using namespace std;
int main()
{
 int n;
 cin >> n;
 int xy[10001][4];
 for (int i = 0; i < n; i++)
 {
  cin >> xy[i][0] >> xy[i][1] >> xy[i][2] >> xy[i][3];
  xy[i][2] += xy[i][0];//计算出每个地毯四个顶点的位置
  xy[i][3] += xy[i][1];
 }
 int a, b;
 cin >> a >> b;
 int sign = 0;
 for (int i = n; i >=0; i--)//从上往下依次检查地毯
 {
  if(xy[i][0]<=a&&xy[i][1]<=b&&xy[i][2]>=a&&xy[i][3]>=b)//点在地毯内
  {
   cout << i+1;
   sign = 1;
   break;
  }
 }
 if (sign == 0)//没有地毯
  cout << -1;
 return 0;
}