铺地毯 题解

直接从后往前找，找到第一个覆盖这个点的地毯输出即可.

import java.math.*;
import java.util.*;
public class Main {
    public static HashMap<String,Long> map = new HashMap<>();
    public static void main(String args[])
    {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int N=0,sum=-1,a,b;
        int num[][] = new int[10000][4];
        for(int i=0;i<n;i++)
        {
            num[i][0] = input.nextInt();
            num[i][1] = input.nextInt();
            num[i][2] = num[i][2] +num[i][0] + input.nextInt();
            num[i][3] = num[i][3] +num[i][1] + input.nextInt();

        }
        a = input.nextInt();
        b = input.nextInt();
        for(int i=n-1;i>=0;i--)
        {
            if(a>=num[i][0]&&a<=num[i][2]&&b>=num[i][1]&&b<=num[i][3])
                {
                sum= i+1;
                break;
                }
        }
            System.out.print(sum);




    }
}