HDU 5623 KK's Number（博弈dp）

题意:

$N\le 5\times 10^4个数, A和B每次都可以拿尽可能多个数, 直到数被拿完$
$每次获得的得分为取的数中的最小值, 两人策略都是尽可能使得自己的得分减去对手的得分更大$
$A先手, 求A得分减去B得分最大为多少$

分析:

$由于每个人都是从大往小拿, 先将序列排序$
$由于得分是最小值, 我们不妨反向思考, f[i]:=剩余i个数, 先手得分-后手得分的最大值$
$转移就看这个数先手取还是不取, 不取则f[i-1], 取则a[i]-f[i-1]$
$ans=f[n]$

代码:

//
//  Created by TaoSama on 2016-02-06
//  Copyright (c) 2016 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, a[N];
long long f[N];

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    int t; scanf("%d", &t);
    while(t--) {
        scanf("%d", &n);
        for(int i = 1; i <= n; ++i) scanf("%d", a + i);
        sort(a + 1, a + 1 + n);
        for(int i = 1; i <= n; ++i)
            f[i] = max(f[i - 1], a[i] - f[i - 1]);
        printf("%I64d\n", f[n]);
    }
    return 0;
}