#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, a[N], b[N], ans = 0;
map <int, int> mm;
int main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) cin >> b[i];
for (int i = 1; i <= n; i++) mm[b[i] - a[i]]++;
for (auto it: mm) ans = max(ans, it.second);
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
16 ms |
1148 KB |
Output is correct |
3 |
Correct |
16 ms |
1144 KB |
Output is correct |
4 |
Correct |
16 ms |
1144 KB |
Output is correct |
5 |
Correct |
23 ms |
1144 KB |
Output is correct |
6 |
Correct |
26 ms |
1144 KB |
Output is correct |
7 |
Correct |
30 ms |
1144 KB |
Output is correct |
8 |
Correct |
27 ms |
1144 KB |
Output is correct |
9 |
Correct |
38 ms |
1528 KB |
Output is correct |
10 |
Correct |
38 ms |
1656 KB |
Output is correct |