제출 #105127

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
105127		leonarda	Jarvis (COCI19_jarvis)	C++14	42 / 70	76 ms	3508 KiB

jarvis

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pi;
typedef long long int lint;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 10;

int n, maki;
int a[maxn], b[maxn];
map<int, int> m;

int main ()
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	cin >> n;
	for(int i = 0; i < n; ++i)
		cin >> a[i];
	for(int i = 0; i < n; ++i)
		cin >> b[i];
		
	for(int i = 0; i < n; ++i) {
		m[a[i] - b[i]]++;
		m[b[i] - a[i]]++;
	}
	
	for(map<int, int>::iterator it = m.begin(); it != m.end(); ++it) {
		maki = max(maki, it -> second);
	}
	
	cout << maki;

return 0;
}
//written and directed by pcelicamaja

• Subtask 1: 42 / 70