暴力枚举--两条公路

暴力枚举–两条公路

#include<bits/stdc++.h>
using namespace std;
int n;


map<int, int >m1, m2;
int maxn = -1;
int  temp(int k1, int k2);
int a[10000];
int b[10000];
int main()

{
    
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int j = 0; j < n; j++)
        cin >> b[j];
    for (int i = 0; i < n; i++)
    {
        m1[a[i] - b[i]]++;
        m2[a[i] + b[i]]++;
    }

    map<int, int>::iterator it1, it2;
    for(it1=m1.begin();it1!=m1.end();it1++)
        for (it2 = m2.begin(); it2 != m2.end(); it2++)
        {
            maxn = max(maxn, temp(it1->first, it2->first));
        }
    cout << maxn;
    return 0;}
int temp(int k1, int k2)
{
    int sum = 0;
    for (int i = 0; i < n; i++)
    {
        if (a[i] - b[i] == k1 || b[i] + a[i] == k2)
            sum++;

    }
    return sum;
}