题意:
给你两个长度为 n n n的数组 a , b a,b a,b,每次交换可以选择一个 i i i,交换 a i , b i a_i,b_i ai,bi,最小化 ∑ i = 1 n ∑ j = i + 1 n ( a i + a j ) 2 + ∑ i = 1 n ∑ j = i + 1 n ( b i + b j ) 2 \sum_{i=1}^n \sum_{j=i+1}^n(a_i+a_j)^2+\sum_{i=1}^n \sum_{j=i+1}^n(b_i+b_j)^2 ∑i=1n∑j=i+1n(ai+aj)2+∑i=1n∑j=i+1n(bi+bj)2。
1 ≤ n ≤ 100 , 1 ≤ a i , b i ≤ 100 1\le n\le 100,1\le a_i,b_i\le 100 1≤n≤100,1≤ai,bi≤100
思路:
首先化简式子, ∑ i = 1 n ∑ j = i + 1 n ( a i + a j ) 2 = ( n − 1 ) ∗ ∑ i = 1 n a i 2 + ∑ i = 1 n ∑ j = 1 n a i a j \sum_{i=1}^n \sum_{j=i+1}^n(a_i+a_j)^2=(n-1)*\sum_{i=1}^na_i^2+\sum_{i=1}^n\sum_{j=1}^na_ia_j ∑i=1n∑j=i+1n(ai+aj)2=(n−1)∗∑i=1nai2+∑i=1n∑j=1naiaj,之后将第二项式子改写为 ( ∑ i = 1 n a i ) 2 − ∑ i = 1 n a i 2 (\sum_{i=1}^na_i)^2-\sum_{i=1}^na_i^2 (∑i=1nai)2−∑i=1nai2,让后化简一下就是 ( n − 2 ) ∗ ∑ i = 1 n a i 2 + ( ∑ i = 1 n a i ) 2 (n-2)*\sum_{i=1}^na_i^2+(\sum_{i=1}^na_i)^2 (n−2)∗∑i=1nai2+(∑i=1nai)2,对于 b b b同理,不难发现前面一块是定值,现在我们只需要最小化 ( ∑ i = 1 n a i ) 2 + ( ∑ i = 1 n b i ) 2 (\sum_{i=1}^na_i)^2+(\sum_{i=1}^nb_i)^2 (∑i=1nai)2+(∑i=1nbi)2即可,考虑用类似背包 d p dp dp求出来 ∑ i = 1 n a i \sum_{i=1}^na_i ∑i=1nai所有可能的值,注意这里 d p dp dp不能继承前一个位置的状态。让后遍历可能的值取最小即可。
#include<bits/stdc++.h>
#define X first
#define Y second
#define L (u<<1)
#define R (u<<1|1)
#define Mid (tr[u].l+tr[u].r>>1)
#define pb push_back
using namespace std;
const int N=110,INF=0x3f3f3f3f,mod=1e9+7;
typedef long long LL;
int n;
int a[N],b[N];
int f[N][N*N*2];
void solve() {
scanf("%d",&n);
int sum=0;
for(int i=1;i<=n;i++) scanf("%d",&a[i]),sum+=a[i];
for(int i=1;i<=n;i++) scanf("%d",&b[i]),sum+=b[i];
memset(f,0,sizeof(f));
f[0][0]=1;
for(int i=1;i<=n;i++) {
for(int j=0;j<=sum;j++) {
if(j>=a[i]) f[i][j]|=f[i-1][j-a[i]];
if(j>=b[i]) f[i][j]|=f[i-1][j-b[i]];
}
}
int ans=sum*sum;
for(int i=0;i<=sum;i++) {
if(!f[n][i]) continue;
ans=min(ans,i*i+(sum-i)*(sum-i));
}
//cout<<sum<<' '<<ans<<endl;
for(int i=1;i<=n;i++) {
ans+=(n-2)*(a[i]*a[i]+b[i]*b[i]);
}
printf("%d\n",ans);
}
int main() {
int _; scanf("%d",&_);
while(_--) {
solve();
}
return 0;
}
/*
1
2
9 8
72 83
*/