codeforces/Array-merging.cpp at master · nirdesh17/codeforces · 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
#include<bits/stdc++.h>
using namespace std;
#define ll long long int

void solve() {
    ll n;
    cin>>n;
    vector<ll> a(n),b(n);
    for(int i=0;i<n;i++)
        cin>>a[i];
    for(int i=0;i<n;i++)
        cin>>b[i];

    vector<ll> mx1(2*n+1);
    vector<ll> mx2(2*n+1);
    ll cnt=1,i;
    for(i=1;i<n;i++)
    {
        if(a[i]==a[i-1])
            cnt++;
        else
        {
            mx1[a[i-1]]=max(cnt,mx1[a[i-1]]);
            cnt=1;
        }
    }
    mx1[a[i-1]]=max(cnt,mx1[a[i-1]]);
    cnt=1;
    for(i=1;i<n;i++)
    {
        if(b[i]==b[i-1])
            cnt++;
        else
        {
            mx2[b[i-1]]=max(cnt,mx2[b[i-1]]);
            cnt=1;
        }
    }
    mx2[b[i-1]]=max(cnt,mx2[b[i-1]]);

    vector<ll> f(2*n+1);
    for(i=1;i<=2*n;i++)
    {
        f[i]=mx1[i]+mx2[i];
    }
    ll sum=0;
    for(i=1;i<=2*n;i++)
        sum=max(sum,f[i]);

    cout<<sum<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}