C. Fault-tolerant Network

// Problem: C. Fault-tolerant Network
// Contest: Codeforces - Educational Codeforces Round 124 (Rated for Div. 2)
// URL: https://codeforces.com/contest/1651/problem/C
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// 2022-03-10 23:06:12
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
const int N= 2e5 + 10;
#define int long long
int n;
int a[N], b[N];
void solve() {
	cin >> n;
	for (int i = 1; i<= n; i ++) cin >> a[i];
	for (int i = 1; i <= n;i ++) cin >> b[i];
	int ans = min(abs(a[1] - b[1]) + abs(a[n] - b[n]),
		abs(a[1] - b[n]) + abs(a[n] - b[1]));
	int a1 = 1e9, a0 = 1e9, b1 = 1e9,b0 = 1e9;
	for (int i = 1; i <= n; i ++) {
		a0 = min (a0, abs(a[1] - b[i]));
		a1 = min (a1, abs(a[n] - b[i]));
		b0 = min (b0, abs(b[1] - a[i]));
		b1 = min(b1, abs(b[n] - a[i]));
	}
	ans = min({ans, abs(a[1] - b[1]) + a1 + b1, 
		abs(a[1] - b[n]) + a1 + b0, 
		abs(a[n] - b[1]) + a0 + b1, 
		abs(a[n] - b[n]) + a0 + b0});
	ans = min (ans, a0 + a1 + b0 + b1);
	cout << ans << endl;
}

signed main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    cin >> t;
    while (t --) solve();
    return 0;
}

题意:给定两个数组，用最少花费将数组连通 这里首先需要发现至多连接四条线，然后先计算出独立的情况，然后去组合他， 正确答案就包括在里面。是子集。

问题特征:规模大，情况一眼看过去多
这里用子问题的解组合出原问题解的解法.