| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1339418 | vjudge1 | Jarvis (COCI19_jarvis) | C++17 | 29 ms | 1140 KiB |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5;
int a[MAXN + 1];
map< int , int >f;
int main() {
ios_base::sync_with_stdio( false );
cin.tie( NULL );
cout.tie( NULL );
int b , n , ans , i;
cin >> n;
for( i = 1 ; i <= n ; i++ )
cin >> a[i];
ans = 0;
for( i = 1 ; i <= n ; i++ ) {
cin >> b;
f[a[i] - b]++;
ans = max( ans , f[a[i] - b] );
}
cout << ans << '\n';
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
