제출 #314612

#제출 시각아이디문제언어결과실행 시간메모리
314612nekiJarvis (COCI19_jarvis)C++14
70 / 70
164 ms2680 KiB
#include <bits/stdc++.h> #define loop(i, a, b) for(long long i=a;i<b;i++) #define pool(i, a, b) for(long long i=a-1;i>=b;i--) #define fore(i, a) for(auto&& i:a) #define fi first #define se second #define ps(a) push_back(a) #define pb(a) pop_back(a) #define sc scanf #define vc vector #define pa pair<ll, ll> #define ll long long #define lb lower_bound #define ub upper_bound #define all(a) a.begin(), a.end() #define llmax LLONG_MAX/2 #define llmin -LLONG_MAX/2 using namespace std; #define mn 2600000 #define pa pair<ll, ll> #define ld long double ll a[mn], b[mn]; map<ll, ll> dp; int main(){ ll n;cin >> n; loop(i, 0, n) cin >> a[i]; loop(i, 0, n) cin >> b[i]; loop(i, 0, n) dp[a[i]-b[i]]++; ll ans=0; fore(v, dp) ans=max(ans, v.se); cout << ans <<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...