| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1339421 | po_rag526 | Jarvis (COCI19_jarvis) | C++20 | 56 ms | 1232 KiB |
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
map<int,int> fv;
int a[maxn];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
int x;
cin>>x;
fv[a[i]-x]++;
}
int maxi=0;
for(auto elem:fv)maxi=max(maxi,elem.second);
cout<<maxi;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
