LeetCode 486. Predict the Winner

题意：两个玩家player 1, player 2依次从一个数组头或者尾选一个数并移除，先手选的数总和大于等于后手则获胜，问先手能否获胜。

博弈DP开始懵逼了，后来感觉都是套路。dp状态定义都是从先手是否赢入手，下一轮player 2会变成先手，然后根据player 2作为先手的得分算出palyer 1的得分。

dp[i,j]表示数组[i,j]段player 1会得多少分，假如player 1选的的num[i],下一轮player 2变成先手，得分是dp[i+1,j]，因为数组是固定的，所以player 1 在下一轮之后得的分数就是sum[i+1,j]-dp[i+1,j]。同理，假如player 1选的的num[j], player 1 在下一轮之后得的分数就是sum[i,j-1]-dp[i,j-1]。

因此对于先手而言,dp[i,j]=max(num[i]+sum[i+1,j]-dp[i+1,j],num[j]+sum[i,j-1]-dp[i,j-1])

其中sum[i,j]可以通过前缀和预处理得出。

 

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<string>
#include<cmath>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
#include<stack>
using namespace std;

//leetcode 486. Predict the Winner
int T;
int N;
int M;

class Solution {
public:
    int** dp;
    int* presum;
    bool PredictTheWinner(vector<int>& nums) {
        int N=nums.size();
        dp= new int*[N];
        for(int i=0;i<N;i++)
        {
            dp[i]=new int[N];
            for(int j=0;j<N;j++)
            {
                dp[i][j]=-1;
            }
        }
        presum=new int[N+1];
        presum[0]=0;
        for(int i=1;i<=N;i++)
        {
            presum[i]=presum[i-1]+nums[i-1];
        }
        for(int i=0;i<N;i++)
        {
            dp[i][i]=nums[i];
        }
        int ans=dfs(0,N-1,nums);
        int total=presum[N]-presum[0];
        delete presum;
        for(int i=0;i<N;i++)
        {
            delete dp[i];
        }
        delete dp;
//        cout<<"ans "<<ans<<endl;
        if(2*ans>=total)
        {
            return true;
        }
        return false;
    }
    int dfs(int st,int ed,vector<int>& nums)
    {
//        cout<<st<<" "<<ed<<endl;
        if(dp[st][ed]!=-1)
        {
//            cout<<"ret0 "<<dp[st][ed]<<endl;
            return dp[st][ed];
        }
        int tmp0=nums[st]+presum[ed+1]-presum[st+1]-dfs(st+1,ed,nums);
//        cout<<"tmp0 "<<tmp0<<" "<<st<<" "<<ed<<" nums "<<nums[st]<<" presum "<<presum[ed+1]-presum[st+1]<<" dp "<<dp[st+1][ed]<<endl;
        int tmp1=nums[ed]+presum[ed]-presum[st]-dfs(st,ed-1,nums);//presum[j]-presum[i]=pre sum of (i,..j]
//        cout<<"tmp1 "<<tmp1<<" "<<st<<" "<<ed<<" nums "<<nums[ed]<<" presum "<<presum[ed]-presum[st]<<" dp "<<dp[st][ed-1]<<endl;
        dp[st][ed]=max(tmp0,tmp1);
//        cout<<"ret0 "<<dp[st][ed]<<endl;
        return dp[st][ed];
    }
};
int main()
{
    freopen("input.txt","r",stdin);
    cin>>T;
    for(int ca=1;ca<=T;ca++)
    {
        cin>>N;
        vector<int>nums1;
        for(int i=0;i<N;i++)
        {
            int tmp;
            cin>>tmp;
            nums1.push_back(tmp);
        }
        Solution sol;
        cout<<"Case #"<<ca<<": "<<sol.PredictTheWinner(nums1)<<endl;

    }
    return 0;
}