Submission #824143

#TimeUsernameProblemLanguageResultExecution timeMemory
824143Trisanu_DasJarvis (COCI19_jarvis)C++17
70 / 70
68 ms2952 KiB
#include <bits/stdc++.h>
using namespace std;
     
int n, a[100005], b[100005];
map<int, int> m;
     
int main() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++)  cin >> b[i];
    int ans = 1;
    for (int i = 0; i < n; i++) {
        m[b[i] - a[i]] += 1;
        ans = max(ans, m[b[i] - a[i]]);
    }
    cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...