From f97796500ebd35c49cf0d38db3d10fef3e37c135 Mon Sep 17 00:00:00 2001
From: pradeeptosarkar <50446690+pradeeptosarkar@users.noreply.github.com>
Date: Fri, 15 Sep 2023 14:26:32 +0000
Subject: [PATCH] Sync LeetCode submission - Stone Game V (cpp)

---
 LeetCode/problems/stone_game_v/solution.cpp | 48 +++++++++++++++++++++
 1 file changed, 48 insertions(+)
 create mode 100644 LeetCode/problems/stone_game_v/solution.cpp

diff --git a/LeetCode/problems/stone_game_v/solution.cpp b/LeetCode/problems/stone_game_v/solution.cpp
new file mode 100644
index 0000000..e11bafb
--- /dev/null
+++ b/LeetCode/problems/stone_game_v/solution.cpp
@@ -0,0 +1,48 @@
+class Solution {
+public:
+    
+    int dp[501][501];
+    
+    int solve(vector<int>& stoneValue, vector<int>& preSum, int i, int j)
+    {
+        if(i>=j)
+            return 0;
+        
+        if(dp[i][j]!=-1)
+            return dp[i][j];
+        
+        int ans=0;
+        
+        for(int k=i;k<j;k++)
+        {
+            int first = preSum[k] - ((i>0)? preSum[i-1]:0);
+            int second = preSum[j]-preSum[k];
+            
+            if(first==second)
+                ans = max(ans, max(first+solve(stoneValue, preSum, i,k), second+solve(stoneValue, preSum,k+1,j)));
+            
+            else if(first<second)
+                ans=max(ans, first+solve(stoneValue, preSum, i,k));
+            
+            else
+                ans=max(ans, second+solve(stoneValue, preSum, k+1,j));
+        }
+        
+        return dp[i][j]=ans;
+    }
+    
+    int stoneGameV(vector<int>& stoneValue) 
+    {
+        memset(dp, -1, sizeof dp);
+        
+        int n=stoneValue.size();
+        
+        vector<int> preSum(n);
+        preSum[0]=stoneValue[0];
+        
+        for(int i=1;i<n;i++)
+            preSum[i]=preSum[i-1]+stoneValue[i];
+        
+        return solve(stoneValue, preSum, 0, n-1);
+    }
+};
\ No newline at end of file