Submission #1339433

#TimeUsernameProblemLanguageResultExecution timeMemory
1339433po_rag526Jarvis (COCI19_jarvis)C++20
70 / 70
56 ms1600 KiB
#include <iostream>
#include <map>
using namespace std;

const int Nmax = 1e5 + 5;

int a[Nmax], b[Nmax];
map<int, int> f;

int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <=n; i ++)
        cin >> a[i];
    for(int i = 1; i <= n; i ++)
        cin >> b[i], f[(b[i] - a[i])] ++;
    int cnt = 0;
    for(auto it: f)
        cnt = max(cnt, it.second);
    cout << cnt;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...