C++ 解法, 执行用时: 1ms, 内存消耗: 624KB, 提交时间: 2017-10-15

//这题太难，能理解对照着写出来就好了
class Stones {
public:
    vector<int> result(int A, int B, int n, vector<int> e, vector<int> a) {
	    // write code here
		for(int i=0; i<=n; ++i)
			fill(dp[i], dp[i]+200, INF);
		dp[n][0] = -INF;

		int sum = 0;
		for(int i=n-1; i>=0; --i)
		{
			sum += a[i];
			for(int j=0; j<=sum; ++j)
			{
				dp[i][j] = min(max(1LL, dp[i+1][j]+e[i]+1),
							   -(dp[i+1][sum-j+1]-1)-e[i]);
			}
		}
		int res = 0;
		for(int j=sum; j>0; --j)
			if(A-B >= dp[0][j])
			{
				res = j;
				break;
			}
		vector<int> ans(2);
		ans[0] = res, ans[1] = sum-res;
		return ans;
     }     
private:
	static const long long INF;
	static const int MAXN = 203;
	long long dp[MAXN][200];
};
const long long Stones::INF = 0x1fffffffffffffff;

C++ 解法, 执行用时: 1ms, 内存消耗: 676KB, 提交时间: 2017-06-12

//智商欠费，实在搞不懂
class Stones {
public:
    vector<int> result(int A, int B, int n, vector<int> e, vector<int> a) {
        // write code here
        const long long inf = 0x3f3f3f3f3f3f3f3f;
        vector<vector<long long>>dp(n + 1, vector<long long>(200, inf));
        int sum = 0, ans;
        dp[n][0] = -inf;
        for (int i = n - 1; i >= 0; i--){
            sum += a[i];
            for (int j = 0; j <= sum; j++){
                long long Achoose = -(dp[i + 1][sum - j + 1] - 1) - e[i];
                long long Apass = max(1ll, dp[i + 1][j] + (e[i] + 1));
                dp[i][j] = min(Achoose, Apass);
                if (i == 0 && dp[i][j] <= A - B)
                    ans = j;
            }
        }
        return vector<int>{ans, sum - ans};
    }
};