Vijos P1530 配对(SCOI2008)题解

DP!!!
先排序
之后从1开始，不断的计算差值，如果a，b相同，对周围的3个进行比较排查
其实我只是不断的试验，才得出是比较3个就行了，证明什么的最麻烦了……请善用搜索引擎……

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<memory.h>
using namespace std;

const long long INF = 0x7ffffffffff;
long long f[100010];
int a[100010],n,b[100010];

long long cele(int x,int y)
{
    if(x == y)
        return INF;
    return abs(x - y);
}

int main()
{
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    memset(f,0,sizeof(f));
    scanf("%d",&n);
    for(int i = 1;i <= n; ++ i)
        scanf("%d%d",&a[i],&b[i]);
    sort(a+1,a+1+n);
    sort(b+1,b+1+n);
    f[1] = cele(a[1],b[1]);
    f[2] = min( f[1] + cele(a[2],b[2]),cele(a[1],b[2]) + cele(a[2],b[1]));
    for(int i = 3;i <=n ; ++ i)
    {
        f[i]=f[i-1]  +  cele(a[i],b[i]);
        f[i]=min(f[i],f[i-2]  +  cele(a[i] , b[i-1])  +  cele(a[i-1],b[i]));
        f[i]=min(f[i],f[i-3] + cele(a[i-2] , b[i]) + cele(a[i-1],b[i-2]) + cele(a[i],b[i-1]));
        f[i]=min(f[i],f[i-3] + cele(a[i-2] , b[i-1]) + cele(a[i-1],b[i]) + cele(a[i],b[i-2]));
        f[i]=min(f[i],f[i-3] + cele(a[i-2] , b[i]) + cele(a[i-1],b[i-1]) + cele(a[i],b[i-2]));
    }
    if(f[n]>INF) 
        printf("-1");
    else 
        printf("%lld",f[n]);
    return 0;
}