1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
| #include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <cstdio>
using namespace std;
typedef long long ll;
#define maxn 100010
int a[maxn],b[maxn];
map<int,int>map1,map2;
bool cmp(int a,int b){
return a > b;
}
int main(){
int n,m;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
b[n - i - 1] = a[i];
}
int num = 1;
for (int i = 0; i < n; i++){
if (map1[a[i]] == 0) map1[a[i]] = i + 1;
}
for (int i = 0; i < n; i++){
if (map2[b[i]] == 0) map2[b[i]] = i + 1;
}
cin >> m;
int cnt;
ll ansmin = 0,ansmax = 0;
for (int i = 0; i < m; i++){
cin >> cnt;
if (map1[cnt] == 0) ansmin += n;
else ansmin += map1[cnt];
if (map2[cnt] == 0) ansmax += n;
else ansmax += map2[cnt];
}
cout << ansmin << ' ' << ansmax << endl;
return 0;
}
|