# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445155 | colossal_pepe | Jarvis (COCI19_jarvis) | C++17 | 102 ms | 2628 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <map>
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 << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |