mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-26 09:11:58 +00:00
39 lines
906 B
C++
39 lines
906 B
C++
#include <iostream>
|
|
#include <cmath>
|
|
|
|
using std::cin;
|
|
using std::cout;
|
|
const char endl = '\n';
|
|
|
|
const int N = 30;
|
|
|
|
int t, n;
|
|
long long a[N], b[N], f[N][2];
|
|
|
|
int main() {
|
|
std::ios::sync_with_stdio(false);
|
|
|
|
cin >> t;
|
|
|
|
while (t--) {
|
|
cin >> n;
|
|
|
|
for (int i = 1; i <= n; i++) {
|
|
cin >> a[i];
|
|
}
|
|
for (int i = 1; i <= n; i++) {
|
|
cin >> b[i];
|
|
}
|
|
|
|
f[1][0] = f[1][1] = 0;
|
|
for (int i = 2; i <= n; i++) {
|
|
f[i][0] = std::min(f[i - 1][0] + std::abs(a[i] - a[i - 1]) + std::abs(b[i] - b[i - 1]), f[i - 1][1] + std::abs(a[i] - b[i - 1]) + std::abs(b[i] - a[i - 1]));
|
|
f[i][1] = std::min(f[i - 1][0] + std::abs(a[i] - b[i - 1]) + std::abs(b[i] - a[i - 1]), f[i - 1][1] + std::abs(b[i] - b[i - 1]) + std::abs(a[i] - a[i - 1]));
|
|
}
|
|
|
|
cout << std::min(f[n][0], f[n][1]) << endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|