POJ1678 I Love this Game!

POJ1678 I Love this Game!

博弈DP，蛮有意思的一道题目。。。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#include<map>

using namespace std;

#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define DOR(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define CLR(a) memset((a),0,sizeof((a)))
#define pb push_back
#define mp make_pair
#define ins insert
#define F first
#define S second
#define bug puts("Oh Here!");

#define nMax 210000
#define oo 999999
#define eps 1e-8

#define LL long long
#define Vec vector<int>
#define Pai pair<int,int>

int f[nMax];
int dp[nMax];
int n,a,b;
int find(int i){
    int x=f[i],l=i+1,r=n-1;
    int ans=n;
    while(l<=r){
        int mid=(l+r)>>1;
        if(f[mid]>=a+x){
            ans = min(ans,mid);
            r=mid-1;
        }else l=mid+1;
    }
    return ans;
}
int dfs(int i){
    if(dp[i]!=-oo) return dp[i];
    int l=find(i);
    int add=oo;
    for(int j=l;j<n;j++)if(f[i]+b>=f[j]){
        add = min(add,f[i]-dfs(j));
    }else break;
    if(add==oo) add=f[i];
    return dp[i]=add;
}
void sovle(){
    sort(f,f+n);
    FOR(i,0,n-1) dp[i]=-oo;
    int ans=-oo;
    FOR(i,0,n-1) if(f[i]>=a && f[i]<=b){
        ans = max(ans,dfs(i));
    }
    if(ans==-oo) ans=0;
    printf("%d\n",ans);
}
int main(){
#ifndef ONLINE_JUDGE
//    freopen("input.txt","r",stdin);
#endif
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d%d",&n,&a,&b);
        FOR(i,0,n-1) scanf("%d",&f[i]);
        sovle();
    }
    return 0;
}