【DP】ZOJ 2068

DP：dp[i][j]表示a前i个，b前j个最小的badness

方程：dp[i][j]=min( dp[i-1][j-1]+(a-b)*(a-b), dp[i-1][j], dp[i][j-1])，注意从a中取的筷子数=b中取的筷子数！

code：

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <string.h>
#include <deque>
#include <stack>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <limits.h>
#include <time.h>

using namespace std;

int lowbit(int t){return t&(-t);}
int countbit(int t){return (t==0)?0:(1+countbit(t&(t-1)));}
int gcd(int a,int b){return (b==0)?a:gcd(b,a%b);}
#define LL long long
#define PI acos(-1.0)
#define N  501
#define MAX INT_MAX
#define MIN INT_MIN
#define eps 1e-8
#define FRE freopen("a.txt","r",stdin)

int dp[N][N];
int a[N],b[N];
int gao(int a,int b){
    return (a-b)*(a-b);
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        int i,j,k;
        int n,m;
        scanf("%d",&n);
        for(i=1;i<=n;i++)scanf("%d",&a[i]);
        scanf("%d",&m);
        for(i=1;i<=m;i++)scanf("%d",&b[i]);
        sort(a+1,a+1+n);
        sort(b+1,b+1+m);
       memset(dp,0,sizeof(dp));
//dp[i][j]表示a前i个，b前j个最小的badness，以下做法保证了此时i之前取a的数目=j之前取b的数目
        for(i=1;i<=n;i++){
            for(j=1;j<=m;j++){
                if(i==j)
                dp[i][j]=dp[i-1][j-1]+gao(a[i],b[j]);
                if(i>j)
                dp[i][j]=min( dp[i-1][j], dp[i-1][j-1]+gao(a[i],b[j]) );
                if(i<j)
                dp[i][j]=min( dp[i][j-1], dp[i-1][j-1]+gao(a[i],b[j]) );
            }
        }
        printf("%d\n",dp[n][m]);
    }
    return 0;
}