46 lines
780 B
C++
46 lines
780 B
C++
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
int n,a[10005],b[10005];
|
|
|
|
void testcase()
|
|
{
|
|
cin >> n;
|
|
for (int i = 1; i <= n; i++)
|
|
cin >> a[i];
|
|
for (int i = 1; i <= n; i++)
|
|
cin >> b[i];
|
|
int ans = 0;
|
|
for (int i = n; i >= 1; i--)
|
|
{
|
|
int cur = 0;
|
|
for (int j = i; j >= 1; j--)
|
|
{
|
|
if (b[j] != a[n - (i - j)])
|
|
cur++;
|
|
}
|
|
ans = max(ans,cur);
|
|
}
|
|
for (int i = n; i >= 1; i--)
|
|
{
|
|
int cur = 0;
|
|
for (int j = i; j >= 1; j--)
|
|
{
|
|
if (a[j] != b[n - (i - j)])
|
|
cur++;
|
|
}
|
|
ans = max(ans,cur);
|
|
}
|
|
cout << ans << '\n';
|
|
}
|
|
|
|
int main()
|
|
{
|
|
int tc;
|
|
cin >> tc;
|
|
while (tc--)
|
|
testcase();
|
|
return 0;
|
|
}
|