CODEFORCES-Problem/ArrayMerging.cpp at main · 10Maruf/CODEFORCES-Problem · GitHub

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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;


int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n;
    cin >> n;
    vector<int> xx(n);
    vector<int> yy(n);
    for (int i = 0; i < n; i++)
    {
        cin >> xx[i];
    }
    for (int i = 0; i < n; i++)
    {
        cin >> yy[i];
    }
    unordered_map<int, int> a;
    unordered_map<int, int> b;
    int count = 1;
    for (int i = 1; i <= n; i++)
    {
        if (i == n)
        {
            a[xx[i - 1]] = max(count, a[xx[i - 1]]);
            break;
        }
        if (xx[i] == xx[i - 1])
        {
            count++;
        }
        else
        {
            a[xx[i - 1]] = max(count, a[xx[i - 1]]);
            count = 1;
        }
    }

    count = 1;
    for (int i = 1; i <= n; i++)
    {
        if (i == n)
        {
            b[yy[i - 1]] = max(count, b[yy[i - 1]]);
            break;
        }
        if (yy[i] == yy[i - 1])
        {
            count++;
        }
        else
        {
            b[yy[i - 1]] = max(count, b[yy[i - 1]]);
            count = 1;
        }
    }

    int ans = 0;
    for (int e : xx)
    {
        ans = max(ans, a[e] + b[e]);
    }
    for (int e : yy)
    {
        ans = max(ans, b[e] + a[e]);
    }
    cout << ans << endl;
    }
    return 0;
}