题解 | 矩形重叠

#include<iostream>
#include<algorithm>
#include<vector>
typedef long long ll;
using namespace std;

int main() {
    int n, count = 0;
    ll a[50][4];
    vector<int> ans(50 * 50, 0);
    cin >> n;
    for (int i = 0; i < 4; i++) {
        for (int j = 0; j < n; j++) {
            cin >> a[j][i];
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            count++;
            for (int k = 0; k < n; k++) {
                if (a[i][0] >= a[k][0] && a[j][1] >= a[k][1] && a[i][0] < a[k][2] &&
                        a[j][1] < a[k][3]) {
                    ans[count]++;
                }
            }
        }
    }
    cout << * max_element (ans.begin(), ans.end());
    return 0;

}