[UVALive5760] Alice and Bob && 博弈

用d[i][j]表示有i个堆为1 其余堆总操作数最多为j(总操作数为去走一个和合并两堆) 

然后进行dp

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#define SF scanf
#define PF printf
#define max(a, b) ((a) < (b) ? (b) : (a))
using namespace std;
typedef long long LL;
const int MAXN = 50;
const int MAXS = 50000;
int d[MAXN+10][MAXS+10], kase;
int dp(int One, int m)
{
	if(~d[One][m]) return d[One][m];
	int &ans = d[One][m] = 0;
	
	if(One == 0) return ans = m & 1;
	if(One == 1) return ans = 1;
	if(m == 1) return ans = dp(One+1, 0);
	if(!dp(One-1, m)) ans = 1;
	if(m > 1 && !dp(One, m-1)) ans = 1;
	if(m > 1 && !dp(One - 1, m + 1)) ans = 1;
	if(One > 1 && !dp(One - 2, m ? m + 3 : m + 2)) ans = 1;
	return ans;
}
int main()
{
	memset(d, -1, sizeof(d));
	int T; SF("%d", &T); while(T--) {
		int sum = 0, x, One = 0, n;
		SF("%d", &n);
		for(int i = 1; i <= n; i++) {
			SF("%d", &x);
			if(x == 1) One++;
			else sum += x;
		}
		if(n != One) sum += (n - One - 1);
		PF("Case #%d: %s\n", ++kase, dp(One, sum) ? "Alice" : "Bob");
	}
}