제출 #1238973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1238973		PlayVoltz	Jarvis (COCI19_jarvis)	C++20	70 / 70	28 ms	2628 KiB

jarvis

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, ans=0;
	cin>>n;
	map<int, int> m;
	vector<int> a(n), b(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]], ans=max(ans, m[a[i]-b[i]]);
	cout<<ans;
}

• Subtask 1: 70 / 70