You are given two arrays a and b both of length n. You will merget these arrays forming another array c of length 2. n. You have to find the maximum length of a subarray consisting of equal values across all arrays c that could be obtained. t A merge of two arrays results in an array c composed by successively taking the first element of either array (as long as that array is nonempty) and removing it. After this step, the element is appended to the back of c. We repeat this operation as long as we can (i.e. at least one array is nonempty).给出中文解释和C++代码

题目描述：给定两个长度为n的数组a和b，将它们合并成另一个长度为2n的数组c。你需要找到c中最长的由相同元素组成的子数组的长度。

思路：将a和b合并成数组c，然后遍历c，记录当前相同元素的个数，取最大值即可。

时间复杂度：O(n)

C++代码实现：

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> 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<int> c(2 * n);
    merge(a.begin(), a.end(), b.begin(), b.end(), c.begin());
    int max_len = 0, len = 1;
    for (int i = 1; i < 2 * n; i++) {
        if (c[i] == c[i - 1]) {
            len++;
        } else {
            max_len = max(max_len, len);
            len = 1;
        }
    }
    max_len = max(max_len, len);
    cout << max_len << endl;
    return 0;
}