Submission #232450

#	Time	Username	Problem	Language	Result	Execution time	Memory
232450		VEGAnn	Jarvis (COCI19_jarvis)	C++14	70 / 70	37 ms	2944 KiB

jarvis

#include <bits/stdc++.h>
#define ft first
#define sd second
using namespace std;
const int N = 100100;
unordered_map<int, int> mp;
int ans = 0, n, a[N], b[N];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n;

    for (int i = 0; i < n; i++)
        cin >> a[i];

    for (int i = 0; i < n; i++) {
        cin >> b[i];
        mp[b[i] - a[i]]++;
    }

    for (auto cr : mp)
        ans = max(ans, cr.sd);

    cout << ans;

    return 0;
}

• Subtask 1: 70 / 70