【DP】猜数游戏—From Gaoyuan Chen

【捂脸】今天晚上太堕落了...TAT

神啊杀了我吧....

========================================================================

题目出自CGY的Hw，如下：

给定一个数 n ，A 想了一个数 x ∈ [1,n] ，B 来猜这个数。每次 B 的询问均为：x ∈ [1,t] ？
A 可能会说谎，但是 A 保证其说谎次数不多于 1 次。求 B 最坏情况下要猜多少次。

这道题居然是DP..好吧..弱逼的自我修养......

具体就看CGY君的解答吧~我只是贴Code的...

高一的小朋友们~FTP上共享了HW的资料哦~

#include<iostream>
#include<cstdio> 
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<climits>
#define ot "%d"
#define kg " "
#define kh "\n"
#ifdef WIN32
#define otl "%I64d"
#else
#define otl "%lld"
#endif
#define max(a, b) ({int _ = (a), __ = (b); _ > __ ? _ : __;})
#define min(a, b) ({int _ = (a), __ = (b); _ < __ ? _ : __;})
#define swap(a, b) ({int _ = (a); (a) = (b); (b) = _;})
#define ms(a, b) memset(a, b, sizeof a);
#define maxn 105

using namespace std;

int n, f[maxn][maxn][maxn];

void init()
{
	freopen("guess.in", "r", stdin);
	freopen("guess.out", "w", stdout);
}

int dp(int a, int b, int c)
{
     if (f[a][b][c]) return f[a][b][c];
     if (a + b + c == 1) return 0;
     int tmp = INT_MAX;
     for (int i = 1, lim = min(1, b + c) + a; i < lim; ++i)
         tmp = min(tmp, max(dp(a - i, b, c), dp(i, 0, b)));
     for (int i = a + 1, lim = a + b; i < lim; ++i)
         tmp = min(tmp, max(dp(i - a, b - i + a, c), dp(a, i - a, b - i + a)));
     for (int i = max(a + b, 1), lim = a + b + c; i < lim; ++i)
         tmp = min(tmp, max(dp(b, 0, a + b + c - i), dp(a, b, i - a - b)));
     return f[a][b][c] = tmp + 1;
}

int main()
{
	init();
	scanf(ot, &n);
	printf(ot, dp(0, n, 0));
    return 0;
}